Fast Algorithm and Implementation of 2-D Discrete Cosine Transform

IEEE Transactions on Circuits and Systems

Volumn 38, Issue 3, 1991, Pages 297-305

  Cho, Nam Ik ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; MATHEMATICAL TRANSFORMATIONS;

2-D DISCRETE COSINE TRANSFORM; FAST 2-D DCT ALGORITHM;

SIGNAL PROCESSING;

EID: 0026130969     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/31.101322     Document Type: Article

References (18)

1. N. Ahmed, T. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE Trans. Commun., vol. COM-23, pp. 90–93, Jan. 1974.
2. N. Ahmed and K. R. Rao, Orthogonal Transforms for Digital Signal Processing. New York: Springer-Verlag, 1975.
3. W. H. Chen, C. H. Smith, and S. C. Fralick, “A fast computational algorithm for discrete cosine transform,” IEEE Trans. Commun., vol. COM-25, pp. 1004–1009, Nov. 1977.
4. M. J. Narashimha and A. M. Peterson, “On the computation of the discrete cosine transform,” IEEE Trans. Commun., vol. COM-26, pp. 934–936, June 1978.
5. M. D. Wagh and H. Ganesh, “A new algorithm for the discrete cosine transform of arbitrary number of points,” IEEE Trans. Comput., vol. C-29, pp. 269–277, Apr. 1980.
6. B. G. Lee, “A new algorithm to compute the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 1243–1245, Dec. 1984.
7. H. S. Hou, “A fast recursive algorithms for computing the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 1455–1461, Oct. 1987.
8. N. I. Cho and S. U. Lee, “DCT algorithms for VLSI parallel implementation,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, pp. 121–127, Jan. 1990.
9. M. Vetterli and H. Nussbaumer, “Simple FFT and DCT algorithms with reduced number of operations,” Signal Process, vol. 6, pp. 267–278, Aug. 1984.
10. P. Duhamel and H. H'Mida, “New 2” DCT algorithms suitable for VLSI implementation,” in Proc. ICASSP'87, pp. 1805–1808, 1987.
11. J. Makhoul, “A fast cosine transform in one and two dimensions,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, pp. 27–34, Feb. 1980.
12. F. A. Kamangar and K. R. Rao, “Fast algorithms for the 2-D discrete cosine transform,” IEEE Trans. Comput., vol. C-31, pp. 899–906, Sept. 1982.
13. M. A. Haque, “A two-dimensional fast cosine transform,” IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-33, pp. 1532–1539, Dec. 1985.
14. C. Ma, “A fast recursive two dimensional cosine transform,” Intelligent Robots and Computer Vision: Seventh in a Series, David P. Casasent, Ed., in Proc. SPIE 1002, pp. 541–548, 1988.
15. M. Vetterli, “Fast 2-D discrete cosine transform,” in Proc. ICASSP'85, Mar. 1985.
16. P. Duhamel and C. Guillemot, “Polynomial transform computation of 2-D DCT,” in Proc. ICASSP'90, pp. 1515–1518, Apr. 1990.
17. N. I. Cho and S. U. Lee, “A fast 4 × 4 DCT algorithm for the recursive 2-D DCT,” IEEE Trans. Acoust., Speech, Signal Processing, submitted for publication.
18. M.-T. Sun, T.-C. Chen, and A. M. Gottlieb, “VLSI implementation of a 16 × 16 discrete cosine transform,” IEEE Trans. Circuits Syst., vol. 36, pp. 610–617, Apr. 1989.