Efficient computation of the short-time DFT based on a modified radix-2 decimation-in-frequency algorithm

• Published in: Signal processing Vol. 92; no. 10; pp. 2525 - 2531
• Main Authors: Montoya-Andrade, D.A., Rosendo-Macías, J.A., Gómez-Expósito, A.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.10.2012; Elsevier
• Subjects: Algorithms; Applied sciences; Computational efficiency; Decimation-in-frequency; Detection, estimation, filtering, equalization, prediction; Exact sciences and technology; Fixed-time-origin STDFT; Information, signal and communications theory; Moving-window DFT; Running DFT; Short-time DFT; Signal and communications theory; Signal processing; Signal, noise; Telecommunications and information theory; Time-dependent DFT; Time-dependent DFT; Running DFT; Decimation-in-frequency; Fixed-time-origin STDFT; Short-time DFT; Moving-window DFT; Time dependence; Discrete Fourier transformation; Signal processing; Recursive algorithm; Computational complexity; Decimation
• ISSN: 0165-1684; 1872-7557
• DOI: 10.1016/j.sigpro.2012.03.018

The general-purpose, non-recursive algorithm to compute the STDFT is based on a radix-2 decimation-in-time scheme. In this work a new algorithm, based on a modified radix-2 decimation-in-frequency scheme, is presented for the efficient computation of the fixed-time-origin STDFT. The proposed method is compared with the existing competing algorithm in terms of computational cost. ► Only one non-recursive efficient algorithm for the STDFT was known until now. ► The paper presents another similar algorithm with less computational cost. ► It is the only fast non-recursive algorithm for the STDFT with fixed time-origin.