New algorithm for the calculation of the Fourier transform of discrete signals
- 1 May 1982
- journal article
- research article
- Published by AIP Publishing in Review of Scientific Instruments
- Vol. 53 (5), 627-630
- https://doi.org/10.1063/1.1137022
Abstract
A new algorithm for the calculation of the Fourier transform of sampled time functions is described. The algorithm is especially applicable to the Fourier analysis of nonperiodic signals which are not band limited. The method is based on second‐degree polynomial interpolations between the sample points. The obtained continuous approximation of the signal allows the determination of the Fourier transform analytically. In the case of exponentially decaying functions the algorithm was found to be significantly more accurate than the conventionally used discrete Fourier transform (DFT). The computing time is only about twice the time required by the fast Fourier transform (FFT) algorithm.Keywords
This publication has 3 references indexed in Scilit:
- New fast Fourier transform algorithm for linear system analysis applied in molecular beam relaxation spectroscopyReview of Scientific Instruments, 1981
- Measurement and analysis of fluorescence decay curvesReview of Scientific Instruments, 1977
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965