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

Marcel D. van de Burgwal, Pascal T. Wolkotte, Gerard J.M. Smit

    Research output: Contribution to journalArticleAcademicpeer-review

    112 Downloads (Pure)


    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.
    Original languageEnglish
    Article number678045
    Number of pages12
    JournalInternational Journal of Reconfigurable Computing
    Publication statusPublished - 2009


    • CAES-EEA: Efficient Embedded Architectures
    • EC Grant Agreement nr.: FP6/001908


    Dive into the research topics of 'Non-power-of-Two FFTs: Exploring the Flexibility of the Montium TP'. Together they form a unique fingerprint.

    Cite this