Fast Algorithms for the 2-D Discrete Cosine Transform
- 1 September 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 31 (9) , 899-906
- https://doi.org/10.1109/tc.1982.1676108
Abstract
Two types of efficient algorithms for fast implementation of the 2-D discrete cosine transform (2-D DCT) are developed. One involves recursive structure which implies that the algorithm for (M/2 X N/2) block be extended to (M X N/2) (M/2 X M) and (M X N) blocks (M and N are integer powers of two). The second algorithm is nonrecursive and therefore it has to be tailored for each block size. Both algorithms involve real arithmetic and they reduce the number of multiplications significantly compared to the fast algorithm developed by Chen et al. [8], while the number of additions remain unchanged.Keywords
This publication has 17 references indexed in Scilit:
- A Symmetric Cosine TransformIEEE Transactions on Computers, 1980
- A New Algorithm for Discrete Cosine Transform of Arbitrary Number of PointsIEEE Transactions on Computers, 1980
- A fast cosine transform in one and two dimensionsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Design of a 24-channel transmultiplexerIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- On a Real-Time Walsh-Hadamard/Cosine Transform Image ProcessorIEEE Transactions on Electromagnetic Compatibility, 1978
- On the Computation of the Discrete Cosine TransformIEEE Transactions on Communications, 1978
- Adaptive Coding of Monochrome and Color ImagesIEEE Transactions on Communications, 1977
- Adaptive transform coding of speech signalsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Comparison of the cosine and Fourier transforms of Markov-1 signalsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Comments on "Discrete Cosine Transform"IEEE Transactions on Computers, 1975