TY - JOUR
T1 - Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length
AU - Chen, Che Hong
AU - Liu, Bin Da
AU - Yang, Jar Ferr
N1 - Funding Information:
Manuscript received February 14, 2004; revised February 18, 2005. This work was supported by the National Science Council, R.O.C. under Grant NSC-93-2220-E-006-005. This paper was recommended by Associate Editor P. Nilsson.
PY - 2005/9
Y1 - 2005/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=27144433663&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27144433663&partnerID=8YFLogxK
U2 - 10.1109/TCSI.2005.852935
DO - 10.1109/TCSI.2005.852935
M3 - Article
AN - SCOPUS:27144433663
VL - 52
SP - 1819
EP - 1831
JO - IEEE Transactions on Circuits and Systems I: Regular Papers
JF - IEEE Transactions on Circuits and Systems I: Regular Papers
SN - 1057-7122
IS - 9
ER -