Optimization of recursive sorting algorithms for implementation in hardware

The paper describes the hardware implementation and optimization of recursive algorithms that sort data using binary trees. Since recursive calls are not directly supported by hardware description languages, they are implemented using the known model of a hierarchical finite state machine (HFSM). The paper suggests new hardware-oriented recursive algorithms, describes their implementation in hardware; reports the results of numerous experiments; provides analysis and comparison of alternative and competitive techniques. The results clearly demonstrate that performance of sorting operations is increased comparing to other known implementations.