US 12,032,490 B2
Method and apparatus for vector sorting
Timothy David Anderson, University Park, TX (US); and Mujibur Rahman, Plano, TX (US)
Assigned to Texas Instruments Incorporated, Dallas, TX (US)
Filed by TEXAS INSTRUMENTS INCORPORATED, Dallas, TX (US)
Filed on Dec. 1, 2022, as Appl. No. 18/073,313.
Application 18/073,313 is a continuation of application No. 17/387,260, filed on Jul. 28, 2021, granted, now 11,550,575.
Application 17/387,260 is a continuation of application No. 16/589,118, filed on Sep. 30, 2019, granted, now 11,106,462, issued on Aug. 31, 2021.
Claims priority of provisional application 62/852,870, filed on May 24, 2019.
Prior Publication US 2023/0099669 A1, Mar. 30, 2023
Int. Cl. G06F 12/10 (2016.01); G06F 7/24 (2006.01); G06F 7/487 (2006.01); G06F 7/499 (2006.01); G06F 7/53 (2006.01); G06F 7/57 (2006.01); G06F 9/30 (2018.01); G06F 9/32 (2018.01); G06F 9/345 (2018.01); G06F 9/38 (2018.01); G06F 9/48 (2006.01); G06F 11/00 (2006.01); G06F 11/10 (2006.01); G06F 12/0862 (2016.01); G06F 12/0875 (2016.01); G06F 12/0897 (2016.01); G06F 12/1009 (2016.01); G06F 12/1045 (2016.01); G06F 17/16 (2006.01); H03H 17/06 (2006.01); G06F 15/78 (2006.01)
CPC G06F 12/1045 (2013.01) [G06F 7/24 (2013.01); G06F 7/487 (2013.01); G06F 7/4876 (2013.01); G06F 7/49915 (2013.01); G06F 7/53 (2013.01); G06F 7/57 (2013.01); G06F 9/3001 (2013.01); G06F 9/30014 (2013.01); G06F 9/30021 (2013.01); G06F 9/30032 (2013.01); G06F 9/30036 (2013.01); G06F 9/30065 (2013.01); G06F 9/30072 (2013.01); G06F 9/30098 (2013.01); G06F 9/30112 (2013.01); G06F 9/30145 (2013.01); G06F 9/30149 (2013.01); G06F 9/3016 (2013.01); G06F 9/32 (2013.01); G06F 9/345 (2013.01); G06F 9/3802 (2013.01); G06F 9/3818 (2013.01); G06F 9/383 (2013.01); G06F 9/3836 (2013.01); G06F 9/3851 (2013.01); G06F 9/3856 (2023.08); G06F 9/3867 (2013.01); G06F 9/3887 (2013.01); G06F 9/48 (2013.01); G06F 11/00 (2013.01); G06F 11/1048 (2013.01); G06F 12/0862 (2013.01); G06F 12/0875 (2013.01); G06F 12/0897 (2013.01); G06F 12/1009 (2013.01); G06F 17/16 (2013.01); H03H 17/0664 (2013.01); G06F 9/30018 (2013.01); G06F 9/325 (2013.01); G06F 9/381 (2013.01); G06F 9/3822 (2013.01); G06F 11/10 (2013.01); G06F 15/7807 (2013.01); G06F 15/781 (2013.01); G06F 2212/452 (2013.01); G06F 2212/60 (2013.01); G06F 2212/602 (2013.01); G06F 2212/68 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A method comprising:
receiving, by a first set of comparators, a first set of vector elements;
receiving, by a second set of comparators, a second set of vector elements;
determining, by the first set of comparators, a first comparison result;
determining, by the second set of comparators, a second comparison result;
receiving, by a processor, the first comparison result and the second comparison result;
determining, by the processor, a count value for each vector element of the first set of vector elements and the second set of vector elements, wherein the count value is based on the first comparison result and the second comparison result; and
storing, by the processor, each vector element of the first set of vector elements and the second set of vector elements into lanes of an output vector based on the count value.