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

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.