• DocumentCode
    1327220
  • Title

    The fast Fourier transform

  • Author

    Brigham, E.O. ; Morrow, R.E.

  • Author_Institution
    LTV Electrosystems, Inc.
  • Volume
    4
  • Issue
    12
  • fYear
    1967
  • Firstpage
    63
  • Lastpage
    70
  • Abstract
    The fast Fourier transform (FFT), a computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained. Examples and detailed procedures are provided to assist the reader in learning how to use the algorithm. The savings in computer time can be huge; for example, an N = 210-point transform can be computed with the FFT 100 times faster than with the use of a direct approach.
  • Keywords
    Data analysis; Differential algebraic equations; Differential equations; Discrete Fourier transforms; Fast Fourier transforms; Fourier series; Fourier transforms; Frequency synthesizers; Laplace equations; Problem-solving;
  • fLanguage
    English
  • Journal_Title
    Spectrum, IEEE
  • Publisher
    ieee
  • ISSN
    0018-9235
  • Type

    jour

  • DOI
    10.1109/MSPEC.1967.5217220
  • Filename
    5217220
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1327220