Comments on "Fast algorithms and implementation of 2-D discrete cosine transform"

This paper shows that using the Loeffler's (see Proc. IEEE ICASSP, vol.2, p.988-91, 1989) one-dimensional (1-D) 8-point discrete cosine transform (DCT) algorithm in Cho and Lee's (see ibid., vol.38, p.297-305, 1991) two-dimensional (2-D) 8/spl times/8-point DCT algorithm will result in an optimal algorithm in the sense of multiplicative complexity theory.

[1]  G.S. Moschytz,et al.  Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[2]  Hong Ren Wu,et al.  A two-dimensional fast cosine transform algorithm based on Hou's approach , 1991, IEEE Trans. Signal Process..

[3]  Ephraim Feig,et al.  Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..

[4]  Nam Ik Cho,et al.  A fast 4×4 DCT algorithm for the recursive 2-D DCT , 1992, IEEE Trans. Signal Process..

[5]  Henry R Wu,et al.  Implementation of Cho and Lee's 2D DCT algorithm using LLM 1D DCT algorithm , 1997 .

[6]  P. Duhamel,et al.  New 2nDCT algorithms suitable for VLSI implementation , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[7]  E. Feig,et al.  On the multiplicative complexity of discrete cosine transforms , 1992, IEEE Trans. Inf. Theory.

[8]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[9]  Pierre Duhamel,et al.  Polynomial transform computation of the 2-D DCT , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[10]  Martin Vetterli,et al.  Fast 2-D discrete cosine transform , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[11]  Hsieh S. Hou.  A fast recursive algorithm for computing the discrete cosine transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[12]  Michael T. Heideman.  Multiplicative complexity, convolution, and the DFT , 1988 .