On the computation of two-dimensional DCT

  title={On the computation of two-dimensional DCT},
  author={Guoan Bi and Gang Li and Kai-Kuang Ma and Teng Chork Tan},
  journal={IEEE Trans. Signal Processing},
A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is presented. It shows that the 2-D DCT can be decomposed into cosine–cosine, cosine–sine, sine–cosine, and sine–sine sequences that can be further decomposed into a number of similar sequences. Compared with other reported algorithms, the proposed one achieves savings on the number of arithmetic operations and has a recursive computational structure that leads to a simplification of the input/output… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
11 Citations
9 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 11 extracted citations


Publications referenced by this paper.
Showing 1-9 of 9 references

A fast 4 4 algorithm for the recursive 2-D DCT

  • IEEE Trans. Signal Processing , vol. 40, pp…
  • 1992
Highly Influential
3 Excerpts

Fast algorithm and implementation of 2-D discrete cosine transform

  • N. I. Cho, S. U. Lee
  • IEEE Trans. Circuits Syst. , vol. 38, pp. 297…
  • 1991
Highly Influential
6 Excerpts

Polynomial transform computation of 2-D DCT

  • P. Duhamel, C. Guillemot
  • Proc. Int. Conf. Acoust., Speech, Signal Process…
  • 1990
Highly Influential
4 Excerpts

On the regular structure for the fast 2-D DCT algorithm

  • IEEE Trans. Circuits Syst. II , vol. 40, pp. 259…
  • 1993
3 Excerpts

A fast recursive two dimensional cosine transform

  • C. Ma
  • Proc. SPIE Intell. Robots Comput. Vision , vol…
  • 1988
3 Excerpts

Coding of Images

  • R. J. Clarke, Transform
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…