Title :
An efficient recursive algorithm for time-varying Fourier transform
Author :
Chen, W. ; Kehtarnavaz, Nasser ; Spencer, T.W.
Author_Institution :
Texas A&M Univ., College Station, TX, USA
fDate :
7/1/1993 12:00:00 AM
Abstract :
An efficient recursive algorithm for computing the time-varying Fourier transform (TVFT) or short-time Fourier transform (STFT) of a time sequence is presented. In this approach, instead of excluding the old samples, their importance is diminished by using all-pole moving windows. This recursive algorithm requires about one half of the computation and storage of the Amin´s algorithm. The resulting TVFT does not possess any sidelobes. The performance of the algorithm is illustrated by two numerical examples
Keywords :
Fourier transforms; signal processing; all-pole moving windows; efficient recursive algorithm; short-time Fourier transform; signal processing; time sequence; time-varying Fourier transform; Adaptive filters; Computational efficiency; Filtering; Fourier transforms; Geophysics; Lattices; Mirrors; Signal processing algorithms; Spectral analysis;
Journal_Title :
Signal Processing, IEEE Transactions on
