On the Regular Structure for the Fast 2-D DCT Algorithm

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

Volumn 40, Issue 4, 1993, Pages 259-266

  Cho, Nam Ik ^a   Yun, Dong ^a   Lee, Sang Uk ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA;

DCT ALGORITHMS; DISCRETE COSINE TRANSFORMS; FAST ALGORITHMS; SIGNAL FLOW GRAPHS;

MATHEMATICAL TRANSFORMATIONS;

EID: 0027576186     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/82.224317     Document Type: Article

References (6)

1. N. I. Cho and S. U. Lee, “Fast algorithm and implementation of 2-D discrete cosine transform,” IEEE Trans. Circuits and Syst., Vol. CAS-38, pp. 297-305, Mar. 1991.
2. P. Duhamel and C. Guillemot, “Polynomial transform computation of 2-D DCT,” in Proc. ICASSP-90, pp. 1515-1518, Apr. 1990.
3. E. Linzer and E. Feig, “New scaled DCT algorithms for fused multiply/add architectures,” in Proc. ICASSP-91, pp. 2201-2204, May 1991.
4. H. S. Hou, “A fast recursive algorithm for computing the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, Vol. ASSP-35, pp. 1455-1461, Oct. 1987.
5. K. R. Rao and P. Yip, Discrete Cosine Transform. New York: Aca¬demic Press 1990, pp. 73–75.
6. R. E. Blahut, Fast Algorithms for Digital Signal Processing. Reading, MA: Addison-Wesley, 1985.