Compact recursive structures for discrete cosine transform

Jar Ferr Yang, Chih Peng Fan

Research output: Contribution to journalArticlepeer-review

26 Citations (Scopus)

Abstract

In this paper, we propose compact recursive structures for computing the discrete cosine transform. With a simple preprocessor, the proposed recursive computation, which can be realized in a fixed-coefficient second-order infinite-impulse response (IIR) filter, requires fewer recursive loops than the previous methods if the transformed length is not a prime number. Due to fewer recursive loops and selected coefficients, the proposed compact recursive structure achieves more accurate results than the other methods. With fast recursion and low roundoff error in transformation, the compact recursive algorithm can be easily realized in VLSI chips.

Original languageEnglish
Pages (from-to)314-321
Number of pages8
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume47
Issue number4
DOIs
Publication statusPublished - 2000 Apr

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Compact recursive structures for discrete cosine transform'. Together they form a unique fingerprint.

Cite this