Internal sorting and FPGA
Al Beechick, Steve Casselman, Lynn D. Yarbrough · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1996
A new general-purpose internal sorting algorithm, called ABCsort, appears unusually well-suited for FPGA implementation. ABCsort is an O(N) algorithm (worst case, in both time and space) that is, even in software, both much faster than other internal sorts and extraordinarily flexible. ABCsort makes only read accesses to record keys, which facilitates its use in parallel on a shared-memory multiprocessor system. Although it will sort floating-point data, it requires no floating-point arithmetic; the algorithm is independent of data type except for semantics logic which is ideal for implementation in reconfigurable FPGA.