Non-Power-of-Two FFTs: Exploring the Flexibility of the MONTIUM


Share/Save/Bookmark

Wolkotte, Pascal T. and Burgwal, Marcel D. van de and Smit, Gerard J.M. (2006) Non-Power-of-Two FFTs: Exploring the Flexibility of the MONTIUM. In: International Symposium on System-on-Chip, SoC 2006, 13-16 November 2005, Tampere, Finland (pp. pp. 167-170).

open access
[img] PDF
208kB
Abstract:Coarse−grained reconfigurable architectures, like the Montium, have proven to be a successful approach for low−power and high−performance computation of regular DSP algorithms. The main research question posed in this paper is: Can such architectures also take over less regular algorithms from general purpose processors? This paper presents the implementation of non−power−of−two Fast Fourier Transforms (FFT) to discover the limitations and flexibility of the Montium. The results of the implementation show a order of magnitude reduction of the processing time and energy consumption compared to an ARM processor. Furthermore, we show the accuracy and flexibility of the implementation.
Item Type:Conference or Workshop Item
Additional information:Imported from CHAMELEON.xml
Copyright:© 2006 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66563
Official URL:http://dx.doi.org/10.1109/ISSOC.2006.321993
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 238270