• DocumentCode
    1180775
  • Title

    Self-sorting in-place FFT algorithm with minimum working space

  • Author

    Qian, Z. ; Lu, C. ; An, M. ; Tolimieri, R.

  • Author_Institution
    Aware Inc., Cambridge, MA, USA
  • Volume
    42
  • Issue
    10
  • fYear
    1994
  • fDate
    10/1/1994 12:00:00 AM
  • Firstpage
    2835
  • Lastpage
    2836
  • Abstract
    Presents a modification of Temperton´s (1991) self-sorting, in-place radix-p FFT algorithm. This modification reduces the required temporary working space from order of p2 to p+1, providing a better match to the limited number of registers in a CPU
  • Keywords
    fast Fourier transforms; matrix algebra; signal processing; in-place radix-p FFT algorithm; minimum working space; modification; required temporary working space; self-sorting in-place FFT algorithm; Discrete Fourier transforms; Fast Fourier transforms; Fourier transforms; Frequency; Indexing; Monitoring; Registers; Tensile stress;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.324749
  • Filename
    324749
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1180775