Gauss and the history of the fast fourier transform

@article{Heideman1984GaussAT,
  title={Gauss and the history of the fast fourier transform},
  author={M. Heideman and D. Johnson and C. Burrus},
  journal={IEEE ASSP Magazine},
  year={1984},
  volume={1},
  pages={14-21}
}
  • 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
    280 Citations

    Topics from this paper.

    The techniques of the generalized fast Fourier transform algorithm
    • R. Stasinski
    • Mathematics, Computer Science
    • IEEE Trans. Signal Process.
    • 1991
    • 18
    The quick Fourier transform: an FFT based on symmetries
    • 35
    • PDF
    The Cooley--Tukey FFT and Group Theory
    • 35
    • PDF
    The quick discrete Fourier transform
    • 25
    Fast Fourier Transforms
    • 5
    Some applications of generalized FFT's
    • D. Rockmore
    • Computer Science, Mathematics
    • Groups and Computation
    • 1995
    • 62
    • PDF
    Automatic generation of fast discrete signal transforms
    • 44
    • PDF
    The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
    • 118
    • Highly Influenced
    • PDF
    The Fast Fourier Transform

    References

    SHOWING 1-10 OF 115 REFERENCES
    An algorithm for the machine calculation of complex Fourier series
    • 10,464
    • PDF
    Note on the calculation of Fourier series
    • 20
    • PDF
    The Fourier Transform and its Applications.
    • 4,887
    • PDF
    How the Fast Fourier Transform Got its Name
    • 4
    FFT pruning
    • 256
    On computing the Discrete Fourier Transform.
    • S. Winograd
    • Mathematics, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 1976
    • 669
    • PDF
    A fast Gaussian method for Fourier transform evaluation
    • L.L. Hope
    • Mathematics
    • Proceedings of the IEEE
    • 1975
    • 6
    A History of Numerical Analysis from the 16th through the 19th Century.
    • 172