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.
[1]
P. Lewis,et al.
Historical notes on the fast Fourier transform
,
1967,
IEEE Transactions on Audio and Electroacoustics.
[2]
W. M. Gentleman,et al.
Fast Fourier Transforms: for fun and profit
,
1966,
AFIPS '66 (Fall).
[3]
Howard D. Helms,et al.
Burst measurements in the frequency domain
,
1966
.
[4]
Thomas G. Stockham,et al.
High-speed convolution and correlation
,
1966,
AFIPS '66 (Spring).
[5]
J. Tukey,et al.
An algorithm for the machine calculation of complex Fourier series
,
1965
.