A hardware sorter suitable for VLSI implementation is proposed. It operates in a parallel and pipelined fashion, with the actual sorting time absorbed by the input/output time. A detailed VLSI implementation is described which has a very favorable device count compared to existing static RAM.
No takes yet. Share an insight, caveat, or question.
Miranker et al. (1983) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: