Efficient computation of the large DFT and DCT coefficients

Authors:
Ali Saidi
Affiliations:
Motorola Applied Research, Boynton Beach, FL
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: digital speech processing - Volume III
Year:
1993

Citing 3
Cited 0

The fast Fourier transform and its applications

The fast Fourier transform and its applications
Discrete-time signal processing

Discrete-time signal processing
Randomized Interpolation and Approximation of Sparse Polynomials

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm for computing the large discrete Fourier transform (DFT) coefficients of a correlated data sequence is introduced. A new formulation of the decimation-infrequency (DIF) FFT algorithm is introduced which generalizes the decimation method FFT algorithm. Then, the radix-2 DIF FFT algorithm is modified to introduce an efficient algorithm for computing the DFT coefficients larger than a given threshold. This algorithm significantly reduces the computations associated with the small coefficients. Results are then extended to all the DIF based FFT algorithms as well as the multidimensional FFT and the FFT based fast Discrete Cosine Transform algorithm.