• DocumentCode
    1366320
  • Title

    On indexing the prime factor fast Fourier transform algorithm

  • Author

    Chan, S.C. ; Ho, K.L.

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong
  • Volume
    38
  • Issue
    8
  • fYear
    1991
  • fDate
    8/1/1991 12:00:00 AM
  • Firstpage
    951
  • Lastpage
    953
  • Abstract
    The Temperton (1985) indexing scheme for the prime factor fast Fourier transform algorithm (PFA-FFT) is generalized to include other prime factor maps. In particular, it is found that the updating scheme for the Ruritanian map can completely avoid the modulo operations required in indexing the data
  • Keywords
    computerised signal processing; fast Fourier transforms; Ruritanian map; Temperton indexing scheme; modulo operation avoidance; prime factor fast Fourier transform algorithm; prime factor maps; updating scheme; Algorithm design and analysis; Circuits and systems; Concurrent computing; DH-HEMTs; Digital signal processing; Discrete Fourier transforms; Fast Fourier transforms; Indexing; Least squares approximation; Signal processing algorithms;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.85638
  • Filename
    85638
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1366320