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.
short-time dft decimation-in-frequency fixed-time-origin stdft moving-window dft time-dependent dft running dft