Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1819-1831 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Circuits and Systems I: Regular Papers |
| Volume | 52 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 2005 Sep 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Cite this
}
Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length. / Chen, Che Hong; Liu, Bin-Da; Yang, Jar-Ferr.
In: IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 52, No. 9, 01.09.2005, p. 1819-1831.Research output: Contribution to journal › Article
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
PY - 2005/9/1
Y1 - 2005/9/1
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 II: Express Briefs
JF - IEEE Transactions on Circuits and Systems II: Express Briefs
SN - 1549-8328
IS - 9
ER -