A Versatile Linear Insertion Sorter Based on a FIFO Scheme

Abstract

Abstract

A configurable high-throughput linear sorter system

“…The node's output set is sent to both its left and right neighbors, so that they too can make sorting decisions autonomously. This architecture coincides with those of single linear sorters [8], [12], which store (key, data) pairs and compare them against neighbors and incoming values. The decision logic to shift, insert of hold a node value is a function of these three sets of inputs, in specific, the tags and validity bits.…”

“…When the sorter is full, new inserted values must replace old ones. This can be done using a FIFO that outputs the Top N results of a list [8]. Another approach augments the incoming data with a tag that indicates either an insertion or a deletion [9].…”

Modular Design of High-Throughput, Low-Latency Sorting Units

“…Perez-Andrade et al [46] propose a linear FIFO-based sorter to partially sort an arbitrary number of input values. Their algorithm discards the smallest sorted element on receiving a new element and finds a position for the new element.…”

A versatile hardware architecture for a CFAR detector based on a linear insertion sorter

“…The SBC has a register with synchronous load to store the value, a counter with synchronous reset and load to store the period life of the value, a comparator, four 2-1 multiplexers and control logic (figure 4). This linear insertion sorter is explained in detail in [9].…”