A new, efficient structure for the short-time Fourier transform, with an application in code-division sonar imaging

1 January 1991

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

No. 15206149,p. 2041-2044 vol.3
https://doi.org/10.1109/icassp.1991.150805

Abstract

Although most applications which use the short-time Fourier transform (STFT) temporally downsample the output, some applications exploit a dense temporal sampling of the STFT. One example, coded-division multiple-beam sonar, is discussed. Given a need for the densely sampled STFT, the complexity of the computation can be reduced from O(N log N) for the general short-time FFT structure to O(N) using the Goertzel algorithm. The authors introduce the pruned short-time FFT, a novel computational structure for efficiently computing the STFT with dense temporal sampling. The pruned FFT achieves the same computational savings as the Goertzel algorithm, but is unconditionally stable.

Keywords

This publication has 4 references indexed in Scilit:

Code-division Multiple Beam Imaging
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
Kronecker Products, Unitary Matrices and Signal Processing Applications
SIAM Review, 1989
Fast algorithms for running ordering and max/min calculation
IEEE Transactions on Circuits and Systems, 1989
A code-division, multiple beam sonar imaging system
Published by MBLWHOI Library ,1989