Non-power-of-Two FFTs: Exploring the Flexibility of the Montium TP

Share/Save/Bookmark

Burgwal, Marcel D. van de and Wolkotte, Pascal T. and Smit, Gerard J.M. (2009) Non-power-of-Two FFTs: Exploring the Flexibility of the Montium TP. International Journal on Reconfigurable Computing, 2009 . p. 678045. ISSN 1687-7195

open access
[img] PDF
1MB
Abstract:Coarse-grain reconfigurable architectures, like the Montium TP, have proven to be a very successful approach for low-power and high-performance computation of regular digital signal processing algorithms. This paper presents the implementation of a class of non-power-of-two FFTs to discover the limitations and Flexibility of the Montium TP for less regular algorithms. A non-power-of-two FFT is less regular compared to a traditional power-of-two FFT. The results of the implementation show the processing time, accuracy, energy consumption and Flexibility of the implementation.
Item Type:Article
Copyright:© 2009 Hindawi Publishing
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/68162
Official URL:http://dx.doi.org/10.1155/2009/678045
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 264424