Regular FFT-related transform kernels for DCT/DST-based polyphase filter banks

1 January 1991

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

No. 15206149,p. 2205-2208 vol.3
https://doi.org/10.1109/icassp.1991.150852

Abstract

A realization for the discrete cosine and sine transforms (DCT and DST) is proposed which is based on an FFT (fast Fourier transform) optimized for DSP (digital signal processor) use. Besides its regular structure, even the theoretically interesting total number of required operations is about the same as needed by the most regular direct approach and only slightly higher than the minimum number yet published. Compared to a similar approach published recently by N. Ramamurthy and M.N.S. Swamy (1990), it is even more efficient.

Keywords

This publication has 7 references indexed in Scilit:

FFT implementation on DSP-chips-theory and practice
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Modulated QMF filter banks with perfect reconstruction
Electronics Letters, 1990
Lapped transforms for efficient transform/subband coding
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences
IEEE Transactions on Circuits and Systems, 1990
The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
Circuits, Systems, and Signal Processing, 1988
Adaptive transform coding incorporating Time Domain Aliasing Cancellation
Speech Communication, 1987
Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series
Proceedings of the IEEE, 1976