The Fast Fourier Transform and Its Applications
- 1 March 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Education
- Vol. 12 (1), 27-34
- https://doi.org/10.1109/te.1969.4320436
Abstract
The advent of the fast Fourier transform method has greatly extended our ability to implement Fourier methods on digital computers. A description of the alogorithm and its programming is given here and followed by a theorem relating its operands, the finite sample sequences, to the continuous functions they often are intended to approximate. An analysis of the error due to discrete sampling over finite ranges is given in terms of aliasing. Procedures for computing Fourier integrals, convolutions and lagged products are outlined.This publication has 10 references indexed in Scilit:
- Application of the fast Fourier transform to computation of Fourier integrals, Fourier series, and convolution integralsIEEE Transactions on Audio and Electroacoustics, 1967
- Historical notes on the fast Fourier transformProceedings of the IEEE, 1967
- What is the fast Fourier transform?Proceedings of the IEEE, 1967
- Faster Fourier analysisJournal of Geophysical Research, 1966
- Note on the calculation of Fourier seriesMathematics of Computation, 1966
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Some improvements in practical Fourier analysis and their application to x-ray scattering from liquidsJournal of the Franklin Institute, 1942
- Tafeln und Aufgaben zur Harmonischen Analyse und PeriodogrammrechnungPublished by Springer Nature ,1939
- Grundlagen und Methoden der PeriodenforschungPublished by Springer Nature ,1937
- Vorlesungen über Numerisches RechnenPublished by Springer Nature ,1924