Recursive architectures for the forward and inverse modified discrete cosine transforms

Che Hong Chen; Chung Bin Wu; Bin-Da Liu; Jar-Ferr Yang

Recursive architectures for the forward and inverse modified discrete cosine transforms

Che Hong Chen, Chung Bin Wu, Bin-Da Liu, Jar-Ferr Yang

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

Abstract

This paper presents recursive architectures for the modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) which are the most complex operations in layer 3 of the MPEG audio coding standard. By rearranging the input data, we first derive two trigonometric equations, which can be represented as the Chebyshev polynomials. Then we demonstrate that the general length of MDCT and IMDCT can be efficiently implemented by the recursive structure. The computational complexity of each data throughput in these two architectures is less than existing related systems by as many as 50%. The proposed regular structure is particularly suitable for parallel VLSI realization.

Original language	English
Pages (from-to)	50-59
Number of pages	10
Journal	IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation
Publication status	Published - 2000

All Science Journal Classification (ASJC) codes

Engineering(all)

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

Cite this

@article{31654192565648b6ba5bd5dc94f12ef2,

title = "Recursive architectures for the forward and inverse modified discrete cosine transforms",

abstract = "This paper presents recursive architectures for the modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) which are the most complex operations in layer 3 of the MPEG audio coding standard. By rearranging the input data, we first derive two trigonometric equations, which can be represented as the Chebyshev polynomials. Then we demonstrate that the general length of MDCT and IMDCT can be efficiently implemented by the recursive structure. The computational complexity of each data throughput in these two architectures is less than existing related systems by as many as 50%. The proposed regular structure is particularly suitable for parallel VLSI realization.",

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

year = "2000",

language = "English",

pages = "50--59",

journal = "IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation",

issn = "1520-6130",

}

TY - JOUR

T1 - Recursive architectures for the forward and inverse modified discrete cosine transforms

AU - Chen, Che Hong

AU - Wu, Chung Bin

AU - Liu, Bin-Da

AU - Yang, Jar-Ferr

PY - 2000

Y1 - 2000

N2 - This paper presents recursive architectures for the modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) which are the most complex operations in layer 3 of the MPEG audio coding standard. By rearranging the input data, we first derive two trigonometric equations, which can be represented as the Chebyshev polynomials. Then we demonstrate that the general length of MDCT and IMDCT can be efficiently implemented by the recursive structure. The computational complexity of each data throughput in these two architectures is less than existing related systems by as many as 50%. The proposed regular structure is particularly suitable for parallel VLSI realization.

AB - This paper presents recursive architectures for the modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) which are the most complex operations in layer 3 of the MPEG audio coding standard. By rearranging the input data, we first derive two trigonometric equations, which can be represented as the Chebyshev polynomials. Then we demonstrate that the general length of MDCT and IMDCT can be efficiently implemented by the recursive structure. The computational complexity of each data throughput in these two architectures is less than existing related systems by as many as 50%. The proposed regular structure is particularly suitable for parallel VLSI realization.

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

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

M3 - Article

AN - SCOPUS:0034508386

SP - 50

EP - 59

JO - IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation

JF - IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation

SN - 1520-6130

ER -