Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
566447 | Signal Processing | 2014 | 9 Pages |
Abstract
•Only two non-recursive efficient algorithms for the STDFT was known until now.•The paper presents another similar algorithm with less computational cost.•The pseudo code for this new best-so-far algorithm is included in the paper.
This work presents a radix-4 decimation-in-frequency algorithm for the efficient computation of the short-time, discrete Fourier transform, which makes use of radix-4 butterflies with time-varying coefficients arising from a fixed time origin.The proposed scheme is successfully compared with existing competing algorithms in terms of computational cost.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Signal Processing
Authors
Dan-El A. Montoya, J.A. Rosendo Macías, A. Gómez-Expósito,