Acceleration of Recursive Data Sorting over Tree-based Structures
DOI:
https://doi.org/10.5755/j01.eee.113.7.612Abstract
The main objective of this paper is to evaluate and improve FPGA-based digital circuits, which implement recursive specifications.Recursive sorting algorithms over binary trees are considered as a case study to evaluate and demonstrate new techniques and theiradvantages. Since recursive calls are not directly supported by hardware description languages, they are implemented using the model ofa hierarchical finite state machine (HFSM). The paper presents analysis and comparison of alternative and competitive techniques fordescribing recursive algorithms in hardware. The experimental results demonstrate that the proposed innovations allow to achieve betterperformance. Obviously, the results of this paper are not limited to recursive sorting alone. They have a wider scope and can be appliedeffectively to numerous systems that implement recursive algorithms over tree-based data structures. Ill. 8, bibl. 10, tabl. 2 (in English;abstracts in English and Lithuanian).Downloads
Published
2011-09-05
How to Cite
Mihhailov, D., Sudnitson, A., Sklyarov, V., & Skliarova, I. (2011). Acceleration of Recursive Data Sorting over Tree-based Structures. Elektronika Ir Elektrotechnika, 113(7), 51-56. https://doi.org/10.5755/j01.eee.113.7.612
Issue
Section
SYSTEM ENGINEERING, COMPUTER TECHNOLOGY
License
The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.
By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.