Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length

Che Hong Chen, Bin Da Liu, Jar Ferr Yang

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)


In this paper, efficient recursive structures for computing arbitrary length M-dimensional (M-D) discrete cosine transform (DCT) and its inverse DCT (IDCT) are proposed. The M-D DCT and IDCT are first converted into condensed one-dimensional (l-D) DCT and discrete sine transform (DST) with a regular preprocessing procedure. The recursive filters for condensed 1-D DCT/DST are then derived by using Chebyshev polynomials to compute M-D DCT/IDCT without data transposition. The proposed structures require fewer recursive loops than traditional 1-D recursive structures, which are realized in M passes anal (M - 1) data transposition by the so-called row-column approach. With advantages of fewer recursive loops and no transposition memory, the proposed structures attain more accurate results and less power consumption than traditional row-column structures. The proposed recursive M-D DCT/IDCT structures are suitable for very large-scale integration implementation due to regular and modular features.

頁(從 - 到)1819-1831
期刊IEEE Transactions on Circuits and Systems I: Regular Papers
出版狀態Published - 2005 九月

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

指紋 深入研究「Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length」主題。共同形成了獨特的指紋。