Recursive architectures for realizing modified discrete cosine transform and its inverse

Che Hong Chen; Bin Da Liu; Jar Ferr Yang

doi:10.1109/TCSII.2003.808895

Recursive architectures for realizing modified discrete cosine transform and its inverse

Che Hong Chen, Bin Da Liu, Jar Ferr Yang

Research output: Contribution to journal › Article › peer-review

38 Citations (Scopus)

Abstract

In this paper, we present efficient recursive architectures for realizing the modified discrete cosine transform (MDCT) and the inverse MDCT (IMDCT) acquired in many audio coding systems. After data rearrangement, the MDCT and IMDCT can be represented as the Chebyshev polynomials such that we can efficiently implement them in the recursive structures. For verification, we design an ASIC to realize the recursive IMDCT. The analyzed results show that the proposed recursive infinite-impulse response (IIR) structures possess advantages of high efficiency and high throughput rate. The high regularity and modularity of the proposed recursive IMDCT and MDCT algorithms are other t merits for very large scale integration implementation.

Original language	English
Pages (from-to)	38-45
Number of pages	8
Journal	IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume	50
Issue number	1
DOIs	https://doi.org/10.1109/TCSII.2003.808895
Publication status	Published - 2003 Jan

All Science Journal Classification (ASJC) codes

Signal Processing
Electrical and Electronic Engineering

Access to Document

10.1109/TCSII.2003.808895

Fingerprint Dive into the research topics of 'Recursive architectures for realizing modified discrete cosine transform and its inverse'. Together they form a unique fingerprint.

Cite this

@article{75d4a3cdc9524f88824f461a65f02968,

title = "Recursive architectures for realizing modified discrete cosine transform and its inverse",

abstract = "In this paper, we present efficient recursive architectures for realizing the modified discrete cosine transform (MDCT) and the inverse MDCT (IMDCT) acquired in many audio coding systems. After data rearrangement, the MDCT and IMDCT can be represented as the Chebyshev polynomials such that we can efficiently implement them in the recursive structures. For verification, we design an ASIC to realize the recursive IMDCT. The analyzed results show that the proposed recursive infinite-impulse response (IIR) structures possess advantages of high efficiency and high throughput rate. The high regularity and modularity of the proposed recursive IMDCT and MDCT algorithms are other t merits for very large scale integration implementation.",

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

note = "Funding Information: Manuscript received July 3, 2001; revised December 23, 2002. This work was in part supported by the Chip Implementation Center and the National Science Council, R.O.C., under Grant NSC 91-2218-E-006-006. This paper was recommended by Associate Editor A. Swami.",

year = "2003",

month = jan,

doi = "10.1109/TCSII.2003.808895",

language = "English",

volume = "50",

pages = "38--45",

journal = "IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing",

issn = "1057-7130",

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

number = "1",

}

TY - JOUR

T1 - Recursive architectures for realizing modified discrete cosine transform and its inverse

AU - Chen, Che Hong

AU - Liu, Bin Da

AU - Yang, Jar Ferr

N1 - Funding Information: Manuscript received July 3, 2001; revised December 23, 2002. This work was in part supported by the Chip Implementation Center and the National Science Council, R.O.C., under Grant NSC 91-2218-E-006-006. This paper was recommended by Associate Editor A. Swami.

PY - 2003/1

Y1 - 2003/1

N2 - In this paper, we present efficient recursive architectures for realizing the modified discrete cosine transform (MDCT) and the inverse MDCT (IMDCT) acquired in many audio coding systems. After data rearrangement, the MDCT and IMDCT can be represented as the Chebyshev polynomials such that we can efficiently implement them in the recursive structures. For verification, we design an ASIC to realize the recursive IMDCT. The analyzed results show that the proposed recursive infinite-impulse response (IIR) structures possess advantages of high efficiency and high throughput rate. The high regularity and modularity of the proposed recursive IMDCT and MDCT algorithms are other t merits for very large scale integration implementation.

AB - In this paper, we present efficient recursive architectures for realizing the modified discrete cosine transform (MDCT) and the inverse MDCT (IMDCT) acquired in many audio coding systems. After data rearrangement, the MDCT and IMDCT can be represented as the Chebyshev polynomials such that we can efficiently implement them in the recursive structures. For verification, we design an ASIC to realize the recursive IMDCT. The analyzed results show that the proposed recursive infinite-impulse response (IIR) structures possess advantages of high efficiency and high throughput rate. The high regularity and modularity of the proposed recursive IMDCT and MDCT algorithms are other t merits for very large scale integration implementation.

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

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

U2 - 10.1109/TCSII.2003.808895

DO - 10.1109/TCSII.2003.808895

M3 - Article

AN - SCOPUS:0037226869

VL - 50

SP - 38

EP - 45

JO - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

JF - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

SN - 1057-7130

IS - 1

ER -

Recursive architectures for realizing modified discrete cosine transform and its inverse

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this