Fast recursive algorithms for 2-D discrete cosine transform

Signal Processing

Volumn 80, Issue 9, 2000, Pages 1917-1935

  Tan, Teng Chork ^a   Bi, Guoan ^a   Tan, Han Ngee ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; DIGITAL ARITHMETIC; TWO DIMENSIONAL;

ARITHMETIC OPERATIONS; DISCRETE COSINE TRANSFORM;

COSINE TRANSFORMS;

EID: 0034275469     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(00)00102-X     Document Type: Article

References (8)

1. Chan S.C., Ho K.L. A new two-dimensional fast cosine transform algorithm. IEEE Trans. Signal Process. 39(2):1991.
2. Clark R.J. Transform Coding of Images. 1985;481-485 Academic Press, London.
3. P. Duhamel, C. Guillemot, Polynomial transform computation of the 2-D DCT, ICASSP-90, Vol. 3 (1990) pp. 1515-1518.
4. Haque M.A. A two-dimensional fast cosine transform. ICASSP ASSP-. 33(6):1985;1532-1539.
5. Hong Ren Wu, ZhiHong Mon Comment on Fast algorithms and implementation of 2-D DCT. IEEE Trans. Circuits Systems Video Technol. 8(2):1998;128-129.
6. Nam Ik Cho, Sang Uk Lee Fast algorithm and implementation of 2-D DCT. IEEE Trans. Circuits Systems. 38(3):1991;297-305.
7. Nam Ik Cho, Sang Uk Lee A Fast 4×4 DCT algorithm for the recursive 2-D DCT. IEEE Trans. Signal Process. 40(9):1992;2166-2173.
8. Rao K.R., Yip P. Discrete Cosine Transform. Algorithms, Advantages, Applications:1990;Academic Press, New York.