Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/AA74171F-9466-47DA-B700-F584A6974AB9 | ||
| Έτος | 2008 | ||
| Τύπος | Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | S. Ninos and A. Dollas, "Modeling recursion data structures for FPGA-based implementation," in International Conference on Field Programmable Logic and Applications, 2008, pp. 11-16. doi: 10.1109/FPL.2008.4629900 https://doi.org/10.1109/FPL.2008.4629900 | ||
| Εμφανίζεται στις Συλλογές |
Recursion is a powerful technique used to solve problems with repeating patterns, and is a fundamental structure in software. To date there is no known general way to apply a recursive solution to reconfigurable hardware; it is considered difficult to implement, of low performance and resource-intensive. In this paper we extend previous results on hardware structures for recursion by V. Sklyarov, and we demonstrate that recursion can be efficiently implemented in a general way on FPGAs. We show that our general, non-optimized architecture presents approximately 3 times speedup against optimized software algorithm implementations. It also shows 75% speedup, at least 40% lower area utilization, and at the same time it is simpler, less designer time consuming and more general vs. previously published hardware implementations.
Copyright © DIAS 2013
