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}
}

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