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

Authors:
D. A. Montoya-Andrade;J. A. Rosendo-Macías;A. Gómez-Expósito
Affiliations:
School of Electrical Engineering, Central University of Venezuela, Caracas, Los Chaguaramos 1041, Venezuela;Department of Electrical Engineering, University of Seville, Camino de los Descubrimientos s/n, 41012 Seville, Spain;Department of Electrical Engineering, University of Seville, Camino de los Descubrimientos s/n, 41012 Seville, Spain
Venue:
Signal Processing
Year:
2012

Citing 10
Cited 0

Fast fourier transforms: a tutorial review and a state of the art

Signal Processing
Digital signal processing (3rd ed.): principles, algorithms, and applications

Digital signal processing (3rd ed.): principles, algorithms, and applications
Discrete-time signal processing (2nd ed.)

Discrete-time signal processing (2nd ed.)
DFT/FFT and Convolution Algorithms: Theory and Implementation

DFT/FFT and Convolution Algorithms: Theory and Implementation
Recursive discrete Fourier transform with unified IIR filter structures

Signal Processing
Adaptive windowed Fourier transform

Signal Processing
A new, efficient structure for the short-time Fourier transform, with an application in code-division sonar imaging

ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Recursive Fourier transform algorithms with integrated windowing

Signal Processing
Monaural speech/music source separation using discrete energy separation algorithm

Signal Processing
Underdetermined blind separation of non-disjoint signals in time-frequency domain based on matrix diagonalization

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

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.