ROHD-HCL provides a component to perform sort of a list of Logic. As of now, we have
Bitonic sort is a pipelined sorting algorithm commonly used in hardware implementations that recursively constructs a bitonic sequence and merges and compares pairs of elements to sort the sequence in ascending or descending order.
The BitonicSort module in ROHD-HCL accept four inputs: the clock clk signal, reset reset signal, a List of Logic()'s toSort, sort order isAscending and the name of the module name.
Note that bitonic sort MUST have List of inputs Logic of length power of two. To sort inputs that do not have length power of two, you must pre-process the inputs ahead by padding with Const(0) to have inputs length of power of two. Additionally, all the widths in the List of toSort must have same width.
An example is shown below sorting 4 inputs of Logic signal that have width 8-bits to descending order.
const dataWidth = 8;
final clk = SimpleClockGenerator(10).clk;
final reset = Logic(name: 'reset');
final toSort = <Logic>[
Const(1, width: dataWidth),
Const(7, width: dataWidth),
Const(2, width: dataWidth),
Const(8, width: dataWidth)
];
final sortMod = BitonicSort(clk, reset, toSort: toSort, isAscending: false, name: 'top_level');
await sortMod.build();