Gauss and the history of the fast fourier transform

  title={Gauss and the history of the fast fourier transform},
  author={M. Heideman and D. Johnson and C. Burrus},
  journal={IEEE ASSP Magazine},
  • M. Heideman, D. Johnson, C. Burrus
  • Published 1984
  • Computer Science
  • IEEE ASSP Magazine
  • THE fast Fourier transform (Fm has become well known . as a very efficient algorithm for calculating the discrete Fourier Transform (Om of a sequence of N numbers. The OFT is used in many disciplines to obtain the spectrum or . frequency content of a Signal, and to facilitate the computation of discrete convolution and correlation. Indeed, published work on the FFT algorithm as a means of calculating the OFT, by J. W. Cooley and J. W. Tukey in 1965 [1], was a turning point in digital signal… CONTINUE READING

    Topics from this paper.

    The Design and Implementation of FFTW3
    • 4,182
    • PDF
    Introduction to Algorithms, Second Edition
    • 2,910
    • PDF
    Modern Computer Algebra
    • 1,491
    • PDF
    The fractional fourier transform
    • 374
    • PDF
    Spectral Finite Element Method
    • 142
    The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
    • 118
    • Highly Influenced
    • PDF
    Applied Numerical Methods with MATLAB for Engineers and Scientists
    • 319
    • PDF


    Publications referenced by this paper.
    • 160,305
    • PDF
    • 307,583
    • PDF
    • 154,630
    • PDF
    An algorithm for the machine calculation of complex Fourier series
    • 10,384
    • PDF
    The Fourier Transform and its Applications.
    • 5,538
    • PDF
    On computing the Discrete Fourier Transform.
    • 667
    • PDF
    FFT pruning
    • 256
    A History of Numerical Analysis from the 16th through the 19th Century.
    • 171
    • PDF
    Historical notes on the fast Fourier transform
    • 83
    • PDF