论文信息 - FFT pruning applied to time domain interpolation and peak localization

FFT pruning applied to time domain interpolation and peak localization

The efficiency of the fast Fourier transform may be increased by removing operations on input values which are zero, and on output values which are not required. This is applied to interpolation of complex and real valued time domain functions. For real functions, analytic signal concepts may be used to get the Hilbert transform as a byproduct, and applied to the cross correlation function this gives an efficient and accurate method for peak localization.

Sverre Holm

[1] Keinosuke Nagai,et al. Pruning the decimation-in-time FFT algorithm with frequency shift , 1986, IEEE Trans. Acoust. Speech Signal Process..

[2] R. Cabot. A note on the application of the Hilbert transform to time delay estimation , 1981 .

[3] A. Nuttall. Invariance of distribution of coherence estimate to second-channel statistics , 1981 .

[4] Yong Lim. An interpolation technique for computing the DFT of a sparse sequence , 1985, IEEE Trans. Acoust. Speech Signal Process..

[5] J. Markel,et al. FFT pruning , 1971 .

[6] T. V. Sreenivas,et al. FFT algorithm for both input and output pruning , 1979 .

[7] W. Haas,et al. A synthesis of frequency domain filters for time delay estimation , 1981 .

[8] R. Gan.,et al. An extended FFT algorithm for ARMA spectral estimation , 1984 .

[9] D. Skinner. Pruning the decimation in-time FFT algorithm , 1976 .

[10] T. Sreenivas,et al. High-resolution narrow-band spectra by FFT pruning , 1980 .

[11] L. Jaroslavski. Comments on "FFT algorithm for both input and output pruning" , 1981 .

[12] David Durand,et al. The Distribution of Length and Components of the Sum of $n$ Random Unit Vectors , 1955 .

[13] J. Hassab,et al. Analysis of discrete implementation of generalized cross correlator , 1981 .