The extended function fast Fourier transform (EF-FFT)

The periodicity assumption implicit in fast Fourier transform (FFT) techniques can be utilized through time-domain prealiasing to obtain the spectral components of infinite-duration time-domain reflectometry signals when they can be modeled, outside the observation window, with step and/or exponential functions. The technique is shown to be more accurate than both conventional windowing and the other FFT approaches described in the literature for analysis of steplike signals. The duality equation relating the extension functions introduced in the extended function FFT (EF-FFT) method to conventional window functions is derived. Using this relation, it is shown that signals with high-frequency content only within the observation window are best analyzed with EF-FFT methods and that signals with time-distributed spectral components (e.g., speech) are best analyzed with conventional FFT methods. >

[1]  H.A. Samulon,et al.  Spectrum Analysis of Transient Response Curves , 1951, Proceedings of the IRE.

[2]  W. L. Gans,et al.  Continuous and discrete Fourier transforms of steplike waveforms , 1982, IEEE Transactions on Instrumentation and Measurement.

[3]  Jurg Waldmeyer Fast Fourier Transform for Step-Like Functions: The Synthesis of Three Apparently Different Methods , 1980, IEEE Transactions on Instrumentation and Measurement.

[4]  A. M. Nicolson Forming the fast Fourier transform of a step response in time-domain metrology , 1973 .

[5]  S. Riad,et al.  Computing the complete fft of a step-like waveform , 1986, IEEE Transactions on Instrumentation and Measurement.

[6]  F. Harris On the use of windows for harmonic analysis with the discrete Fourier transform , 1978, Proceedings of the IEEE.