How the FFT gained acceptance
James W. Cooley
ACM HSNC 1987
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. © 1967, IEEE. All rights reserved.
James W. Cooley
ACM HSNC 1987
James W. Cooley, Peter A. W. Lewis, et al.
IEEE Transactions on Audio and Electroacoustics
James W. Cooley, John W. Tukey
Mathematics of Computation
Ramesh C. Agarwal, James W. Cooley
IEEE Transactions on Acoustics, Speech, and Signal Processing