Sorting binary numbers in hardware - A novel algorithm and its implementation


This paper describes a novel algorithm for sorting binary numbers in hardware, along with a custom VLSI hardware design for the same. For sorting n, k-bit binary numbers, our proposed algorithm takes O(n + 2k) time. Sorting is performed by assigning relative ranks to the input numbers. A rank matrix of size n × n is used to store ranks. Each row of… (More)
DOI: 10.1109/ISCAS.2009.5118240


6 Figures and Tables