Title
Non-power-of-two FFTs: exploring the flexibility of the montium TP
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.
Year
DOI
Venue
2009
10.1155/2009/678045
Int. J. Reconfig. Comp.
Keywords
Field
DocType
regular digital signal processing,montium tp,energy consumption,coarse-grain reconfigurable architecture,successful approach,non-power-of-two fft,i. introduction,regular algorithm,processing time,non-power-of-two ffts,high-performance computation,digital signal processing
Computer science,Parallel computing,Real-time computing,Fast Fourier transform,Energy consumption,Digital signal processing algorithms,Power of two,Computation
Journal
Volume
Citations 
PageRank 
2009,
1
0.39
References 
Authors
9
3
Name
Order
Citations
PageRank
Marcel D. Van De Burgwal1344.03
Pascal T. Wolkotte229418.13
Gerard J. M. Smit388889.18