Compact recursive structures for discrete cosine transform

Jar Ferr Yang, Chih Peng Fan

研究成果: Article同行評審

26 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)314-321
頁數8
期刊IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
47
發行號4
DOIs
出版狀態Published - 2000 四月

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

指紋 深入研究「Compact recursive structures for discrete cosine transform」主題。共同形成了獨特的指紋。

引用此