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

Fahad Qureshi, Jarmo Takala

    Tutkimustuotos: KonferenssiartikkeliScientificvertaisarvioitu

    1 Sitaatiot (Scopus)

    Abstrakti

    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.
    AlkuperäiskieliEnglanti
    Otsikko2017 51st Asilomar Conference on Signals, Systems, and Computers
    KustantajaIEEE
    ISBN (elektroninen)978-1-5386-1823-3
    DOI - pysyväislinkit
    TilaJulkaistu - 2017
    OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
    TapahtumaASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS -
    Kesto: 1 tammik. 1900 → …

    Julkaisusarja

    Nimi
    ISSN (elektroninen)2576-2303

    Conference

    ConferenceASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS
    Ajanjakso1/01/00 → …

    Julkaisufoorumi-taso

    • Jufo-taso 1

    Sormenjälki

    Sukella tutkimusaiheisiin 'Twiddle Factor Complexity Analysis of Radix-2 FFT Algorithms for Pipelined Architectures'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

    Siteeraa tätä