The Fast Fourier Transform Its Applications USP（快速傅里叶变换应用的早餐）.pdf

IEEE TRANSACTIONS ON EDUCATION, VOL. 12, NO. 1, MARCH 1969 27 The Fast Fourier Transform and Its Applications JAMES W. COOLEY, PETER A. W. LEWIS, AND PETER D. WELCH Abstract-The advent of the fast Fourier transform method has It is most likely that with the relatively small values of greatly extended our ability to implement Fourier methods on digital N used in preelectronic computer days, the former computers. A description of the alogorithm and its programming is methods were easier to use and took fewer operations. given here and followed by a theorem relating its operands, the finite sample sequences, to the continuous functions they often are in- Consequently, the methods requiring Nlog Noperations tended to approximate. An analysis of the error due to discrete sam- were neglected. With the arrival of electronic computers pling over finite ranges is given in terms of aliasing. Procedures for capable of doing calculations of Fourier transforms with computing Fourier integrals, convolutions and lagged products are large values of N, the N log Nmethods were overlooked outlined. and the well-known hand calculator methods were pro- HISTORICAL BACKGROUND grammed for the computers. Perhaps there is something T HE FAST Fourier transform algorithm has an to be learned from this experience, namely, that there interesting history which has been described in may exist numerical methods in the older literature [3]. Time does not permit repeating this history which should be reappraised whenever computing de- here in detail. The essentials are, however, that until vices undergo radical changes.