Direct recursive structures for computing radix-r two-dimensional DCT

Che Hong Chen; Bin Da Liu; Jar Ferr Yang

Direct recursive structures for computing radix-r two-dimensional DCT

Che Hong Chen, Bin Da Liu, Jar Ferr Yang

Research output: Contribution to journal › Conference article › peer-review

Abstract

In this paper, new recursive structures for computing radix-r two-dimensional discrete cosine transform (2-D DCT) are proposed. Based on the same indices of transform bases, the regular pre-add preprocess is established and the recursive structures for 2-D DCT, which can be realized in a second-order infinite-impulse response (IIR) filter, are derived without involving any transposition procedure. For computation of 2-D DCT, the recursive loops of the proposed structures are less than that of one-dimensional DCT recursive structures, which need data transposition to achieve the so-called row-column approach. With advantages of fewer recursive loops and no transposition, the proposed recursive structures achieve more accurate results than the existed methods. The regular and modular properties are suitable for VLSI implementation.

Original language	English
Pages (from-to)	IV269-II272
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	4
Publication status	Published - 2003
Event	Proceedings of the 2003 IEEE International Symposium on Circuits and Systems - Bangkok, Thailand Duration: 2003 May 25 → 2003 May 28

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Cite this

@article{2d265b3c68b64bab9b746e120e64b7ca,

title = "Direct recursive structures for computing radix-r two-dimensional DCT",

abstract = "In this paper, new recursive structures for computing radix-r two-dimensional discrete cosine transform (2-D DCT) are proposed. Based on the same indices of transform bases, the regular pre-add preprocess is established and the recursive structures for 2-D DCT, which can be realized in a second-order infinite-impulse response (IIR) filter, are derived without involving any transposition procedure. For computation of 2-D DCT, the recursive loops of the proposed structures are less than that of one-dimensional DCT recursive structures, which need data transposition to achieve the so-called row-column approach. With advantages of fewer recursive loops and no transposition, the proposed recursive structures achieve more accurate results than the existed methods. The regular and modular properties are suitable for VLSI implementation.",

author = "Chen, {Che Hong} and Liu, {Bin Da} and Yang, {Jar Ferr}",

year = "2003",

language = "English",

volume = "4",

pages = "IV269--II272",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 2003 IEEE International Symposium on Circuits and Systems ; Conference date: 25-05-2003 Through 28-05-2003",

}

TY - JOUR

T1 - Direct recursive structures for computing radix-r two-dimensional DCT

AU - Chen, Che Hong

AU - Liu, Bin Da

AU - Yang, Jar Ferr

PY - 2003

Y1 - 2003

N2 - In this paper, new recursive structures for computing radix-r two-dimensional discrete cosine transform (2-D DCT) are proposed. Based on the same indices of transform bases, the regular pre-add preprocess is established and the recursive structures for 2-D DCT, which can be realized in a second-order infinite-impulse response (IIR) filter, are derived without involving any transposition procedure. For computation of 2-D DCT, the recursive loops of the proposed structures are less than that of one-dimensional DCT recursive structures, which need data transposition to achieve the so-called row-column approach. With advantages of fewer recursive loops and no transposition, the proposed recursive structures achieve more accurate results than the existed methods. The regular and modular properties are suitable for VLSI implementation.

AB - In this paper, new recursive structures for computing radix-r two-dimensional discrete cosine transform (2-D DCT) are proposed. Based on the same indices of transform bases, the regular pre-add preprocess is established and the recursive structures for 2-D DCT, which can be realized in a second-order infinite-impulse response (IIR) filter, are derived without involving any transposition procedure. For computation of 2-D DCT, the recursive loops of the proposed structures are less than that of one-dimensional DCT recursive structures, which need data transposition to achieve the so-called row-column approach. With advantages of fewer recursive loops and no transposition, the proposed recursive structures achieve more accurate results than the existed methods. The regular and modular properties are suitable for VLSI implementation.

UR - http://www.scopus.com/inward/record.url?scp=17944404177&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17944404177&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:17944404177

SN - 0271-4310

VL - 4

SP - IV269-II272

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

T2 - Proceedings of the 2003 IEEE International Symposium on Circuits and Systems

Y2 - 25 May 2003 through 28 May 2003

ER -

Direct recursive structures for computing radix-r two-dimensional DCT

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this