Non-Power-of-Two FFTs: Exploring the Flexibility of the Montium TP. (2nd September 2009)

• Record Type: Journal Article
• Authors: van de Burgwal, Marcel D.; Wolkotte, Pascal T.; Smit, Gerard J. M.
• Other Names: Hauck Scott Academic Editor.
• Is Part Of: International journal of reconfigurable computing. Volume 2009(2009)
• Publication Date: 2009-09-02
• Subjects: Adaptive computing systems -- Periodicals; Adaptive computing systems; Periodicals; 004
• DOI: 10.1155/2009/678045
• Languages: English
• ISSNs: 1687-7195

Abstract

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.