EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||||
|
Wolkotte, P.T. and van de Burgwal, M.D. and Smit, G.J.M.
(2006)
Non-Power-of-Two FFTs: Exploring the Flexibility of the MONTIUM.
In: Proceedings of the International Symposium on System-on-Chip (SoC 2006), 13-16 Nov 2005, Tampere, Finland.
pp. 167-170.
IEEE Computer Society.
ISBN 1-4244-0621-8
Full text available as:
Official URL: http://dx.doi.org/10.1109/ISSOC.2006.321993 ![]() AbstractCoarse−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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||||
