Recursive discrete cosine transforms with selectable fixed-coefficient filters

Jar Ferr Yang, Chih Peng Fan

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


In this transactions brief, we propose new fixed-coefficient recursive structures for computing discrete cosine transforms with the power-of-two length. The fixed-coefficient recursive structures are developed by exploring the periodicity embedded in transform bases, whose indices can form a complete residue system or a complete odd residue system. After simple data manipulation, the proposed filtering structures requiring fixed-coefficient multipliers are better than the previous recursive methods which need general multipliers in filter realization. In particular, we found that the properly selected fixed-coefficient filters achieve lower roundoff errors than the nominal variable-coefficient ones for computing DCT's in finite-word-length machines.

Original languageEnglish
Pages (from-to)211-216
Number of pages6
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Issue number2
Publication statusPublished - 1999 Feb

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Recursive discrete cosine transforms with selectable fixed-coefficient filters'. Together they form a unique fingerprint.

Cite this