IEEE Transactions on Audio and Electroacoustics · 1967 · 496 citations · 4 references
ComputingComputer ScienceElectrical EngineeringSequence AnalysisStatistical ComputingTime Series AnalysisComputational Time Series AnalysisDigital Signal ProcessingFourier AnalysisSignal ProcessingSpectral AnalysisTime Series ComputationDiscrete Fourier TransformFast Fourier TransformFilter SimulationFourier Transform
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.
4
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
W. Morven Gentleman, Gordon Sande · 1966 · 522 citations · Full text
High-speed convolution and correlation
Thomas G. Stockham · 1966 · 316 citations · Full text