What is the fast Fourier transform?
- 1 June 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Audio and Electroacoustics
- Vol. 15 (2) , 45-55
- https://doi.org/10.1109/tau.1967.1161899
Abstract
The fast Fourier transform is a computational tool which facilitates signal analysis such as power spectrum analysis and filter simulation by means of digital computers. It is a method for efficiently computing the discrete Fourier transform of a series of data samples (referred to as a time series). In this paper, the discrete Fourier transform of a time series is defined, some of its properties are discussed, the associated fast method (fast Fourier transform) for computing this transform is derived, and some of the computational aspects of the method are presented. Examples are included to demonstrate the concepts involved.Keywords
This publication has 4 references indexed in Scilit:
- Burst measurements in the frequency domainProceedings of the IEEE, 1966
- High-speed convolution and correlationPublished by Association for Computing Machinery (ACM) ,1966
- Fast Fourier TransformsPublished by Association for Computing Machinery (ACM) ,1966
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965