Application of the fast Fourier transform to computation of Fourier integrals, Fourier series, and convolution integrals
IEEE Transactions on Audio and ElectroacousticsPublished 1 June 1967
J.W. Cooley, Peter Lewis, P. D. Welch
Citations203
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The properties of the finite Fouriertransform are related to commonly used integral transforms including the Fourier transform and convolution integrals.
Abstract
The fast Fourier transform is a computational procedure for calculating the finite Fourier transform of a time series. In this paper, the properties of the finite Fourier transform are related to commonly used integral transforms including the Fourier transform and convolution integrals. The relationship between the finite Fourier transform and Fourier series is also discussed.
Keywords
Computer Science