Twiddle Factor Complexity Analysis of Radix-2 FFT Algorithms for Pipelined Architectures

Fahad Qureshi, Jarmo Takala

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    1 Citation (Scopus)

    Abstract

    This paper presents analysis of fast Fourier transform (FFT) algorithms for pipelined architectures that can be generated by using binary tree representation. Those algorithms have different twiddle factors, however the butterfly operations remain same. Twiddle factor can be implemented by different techniques, which has different hardware cost. This analysis is based on twiddle factors hardware cost of each FFT algorithm. In results, we have shown the trade-off between the hardware components of twiddle factor for selected FFT algorithms.
    Original languageEnglish
    Title of host publication2017 51st Asilomar Conference on Signals, Systems, and Computers
    PublisherIEEE
    ISBN (Electronic)978-1-5386-1823-3
    DOIs
    Publication statusPublished - 2017
    Publication typeA4 Article in conference proceedings
    EventAsilomar Conference on Signals, Systems and Computers -
    Duration: 1 Jan 1900 → …

    Publication series

    Name
    ISSN (Electronic)2576-2303

    Conference

    ConferenceAsilomar Conference on Signals, Systems and Computers
    Period1/01/00 → …

    Publication forum classification

    • Publication forum level 1

    Fingerprint

    Dive into the research topics of 'Twiddle Factor Complexity Analysis of Radix-2 FFT Algorithms for Pipelined Architectures'. Together they form a unique fingerprint.

    Cite this