Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT, and subband synthesis filtering

Zhan Yuan Cheng; Che Hong Chen; Bin Da Liu; Jar Ferr Yang

Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT, and subband synthesis filtering

Zhan Yuan Cheng, Che Hong Chen, Bin Da Liu, Jar Ferr Yang

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

Abstract

In this paper, a unified fixed-coefficient recursive structure for computing the general length discrete transforms is proposed. After the regular data preprocessing, the general discrete transforms are simplified and converted into the simpler DCT, which is realized in a second-order infinite-impulse response (IIR) filter. The proposed recursive structure only requires half the recursive cycles and also achieves more accurate results than the existing ones. Furthermore, the proposed algorithm can be applied to many popular transforms, such as subband synthesis filtering, inverse modified discrete cosine transform (IMDCT) and all discrete cosine transform (DCT) types. The proposed structure is extremely regular and more suitable for VLSI implementation.

Original language	English
Pages (from-to)	III557-III560
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	3
Publication status	Published - 2004
Event	2004 IEEE International Symposium on Cirquits and Systems - Proceedings - Vancouver, BC, Canada Duration: 2004 May 23 → 2004 May 26

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Cite this

@article{e6037fc2ad5b4f68af04f7770a47dd19,

title = "Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT, and subband synthesis filtering",

abstract = "In this paper, a unified fixed-coefficient recursive structure for computing the general length discrete transforms is proposed. After the regular data preprocessing, the general discrete transforms are simplified and converted into the simpler DCT, which is realized in a second-order infinite-impulse response (IIR) filter. The proposed recursive structure only requires half the recursive cycles and also achieves more accurate results than the existing ones. Furthermore, the proposed algorithm can be applied to many popular transforms, such as subband synthesis filtering, inverse modified discrete cosine transform (IMDCT) and all discrete cosine transform (DCT) types. The proposed structure is extremely regular and more suitable for VLSI implementation.",

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

year = "2004",

language = "English",

volume = "3",

pages = "III557--III560",

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

issn = "0271-4310",

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

note = "2004 IEEE International Symposium on Cirquits and Systems - Proceedings ; Conference date: 23-05-2004 Through 26-05-2004",

}

TY - JOUR

T1 - Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT, and subband synthesis filtering

AU - Cheng, Zhan Yuan

AU - Chen, Che Hong

AU - Liu, Bin Da

AU - Yang, Jar Ferr

PY - 2004

Y1 - 2004

N2 - In this paper, a unified fixed-coefficient recursive structure for computing the general length discrete transforms is proposed. After the regular data preprocessing, the general discrete transforms are simplified and converted into the simpler DCT, which is realized in a second-order infinite-impulse response (IIR) filter. The proposed recursive structure only requires half the recursive cycles and also achieves more accurate results than the existing ones. Furthermore, the proposed algorithm can be applied to many popular transforms, such as subband synthesis filtering, inverse modified discrete cosine transform (IMDCT) and all discrete cosine transform (DCT) types. The proposed structure is extremely regular and more suitable for VLSI implementation.

AB - In this paper, a unified fixed-coefficient recursive structure for computing the general length discrete transforms is proposed. After the regular data preprocessing, the general discrete transforms are simplified and converted into the simpler DCT, which is realized in a second-order infinite-impulse response (IIR) filter. The proposed recursive structure only requires half the recursive cycles and also achieves more accurate results than the existing ones. Furthermore, the proposed algorithm can be applied to many popular transforms, such as subband synthesis filtering, inverse modified discrete cosine transform (IMDCT) and all discrete cosine transform (DCT) types. The proposed structure is extremely regular and more suitable for VLSI implementation.

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

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

M3 - Conference article

AN - SCOPUS:4344629557

SN - 0271-4310

VL - 3

SP - III557-III560

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

T2 - 2004 IEEE International Symposium on Cirquits and Systems - Proceedings

Y2 - 23 May 2004 through 26 May 2004

ER -

Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT, and subband synthesis filtering

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this