Trade-off's in the computation of mono- and multi-dimensional DCT's
- 13 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 999-1002 vol.2
- https://doi.org/10.1109/icassp.1989.266599
Abstract
An overview of some alternative algorithms for one- and two-dimensional DCTs (discrete cosine transforms) is given. Operation counts are derived for typical examples useful in image processing. It is shown that it is possible to generalize the 2-D schemes to 3-D DCTs as well. The result is that a 3-D DCT can be obtained from a 3-D DFT (discrete Fourier transform) of the same size on reals at the cost of permutations and O(3/2N/sup 3/) multiplications. The scheme involves rotations on eight output points at a time. Improvements through scaling are discussed, and implementation issues (both in hardware and software) are addressed.Keywords
This publication has 9 references indexed in Scilit:
- Fast 2-D discrete cosine transformPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Algorithm-architecture mapping for custom DSP chipsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Computation of an odd-length DCT from a real-valued DFT of the same lengthIEEE Transactions on Signal Processing, 1992
- In-place butterfly-style FFT of 2-D real sequencesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1982
- On the Computation of the Discrete Cosine TransformIEEE Transactions on Communications, 1978
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- Discrete Cosine TransformIEEE Transactions on Computers, 1974