• DocumentCode
    491491
  • Title

    Efficient Implementation of Prime Factor Fourier Transforms

  • Author

    harris, fred ; Johnson, Eric S.

  • Author_Institution
    Department of Electrical and Computer Engineering, San Diego State University
  • Volume
    1
  • fYear
    1986
  • fDate
    5-9 Oct. 1986
  • Abstract
    The Winograd small factor Fourier transforms can be formed with a small number of common signal flow structures reminiscent of the butterfly in the Cooley Tuckey radix-2 fast Fourier transform (FFT) algorithm. This paper identifies these structures and describes a versitile and compact prime factor algorithm (PFA) which incorporates them. Running time and program code space requirements for this algorithm are presented and are compared to classic radix-2 and radix-4 FFT algorithms.
  • Keywords
    Algorithms; Application software; Arithmetic; Cathode ray tubes; Code standards; Discrete Fourier transforms; Fast Fourier transforms; Flow graphs; Fourier transforms; Frequency;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Military Communications Conference - Communications-Computers: Teamed for the 90's, 1986. MILCOM 1986. IEEE
  • Conference_Location
    Monterey, CA, USA
  • Type

    conf

  • DOI
    10.1109/MILCOM.1986.4805682
  • Filename
    4805682
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=491491