A recursive DCT algorithm with new distributed arithmetic

Y. M. Chien, Y. Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this work a recursive DCT algorithm based upon both decomposition and new distributed arithmetic (NEDA) is presented. In the proposed algorithm, the computation of the DCT coefficient is firstly decomposed into small matrices and then the NEDA structure is employed to compute the coefficient. As a result less computational or hardware complexity is required for the DCT implementation as compared to the NEDA approach without decomposition. In addition, with the same bit precision (quantization) the proposed algorithm can achieve a better PSNR performance over the NEDA approach.

Original languageEnglish
Title of host publication2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings - Circuits and Systems
Pages2582-2587
Number of pages6
DOIs
StatePublished - 2006
Event2006 International Conference on Communications, Circuits and Systems, ICCCAS - Guilin, China
Duration: 25 Jun 200628 Jun 2006

Publication series

Name2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings
Volume4

Conference

Conference2006 International Conference on Communications, Circuits and Systems, ICCCAS
Country/TerritoryChina
CityGuilin
Period25/06/0628/06/06

Fingerprint

Dive into the research topics of 'A recursive DCT algorithm with new distributed arithmetic'. Together they form a unique fingerprint.

Cite this