• DocumentCode
    1468022
  • Title

    An extended split-radix FFT algorithm

  • Author

    Takahashi, Daisuke

  • Author_Institution
    Dept. of Inf. & Comput. Sci., Saitama Univ., Urawa, Japan
  • Volume
    8
  • Issue
    5
  • fYear
    2001
  • fDate
    5/1/2001 12:00:00 AM
  • Firstpage
    145
  • Lastpage
    147
  • Abstract
    An extended split-radix fast Fourier transform (FFT) algorithm is proposed. The extended split-radix FFT algorithm has the same asymptotic arithmetic complexity as the conventional split-radix FFT algorithm. Moreover, this algorithm has the advantage of fewer loads and stores than either the conventional split-radix FFT algorithm or the radix-4 FFT algorithm.
  • Keywords
    computational complexity; fast Fourier transforms; signal processing; asymptotic arithmetic complexity; conventional split-radix FFT algorithm; extended split-radix FFT algorithm; fast Fourier transform; radix-4 FFT algorithm; signal processing; Arithmetic; Computer science education; Discrete Fourier transforms; Fast Fourier transforms; Helium; Performance evaluation; Signal processing algorithms;
  • fLanguage
    English
  • Journal_Title
    Signal Processing Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1070-9908
  • Type

    jour

  • DOI
    10.1109/97.917698
  • Filename
    917698
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1468022