Open AccessNEW RECURSIVE DCT IMPLEMENTATIONS WITH GOERTZEL FILTERS
Author(s) -
S.S. Demirsoy,
Robert J. Beck,
I. Kale,
Andrew G. Dempster
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.1.1.73
Subject(s) - discrete cosine transform , multiplier (economics) , implementation , power consumption , computer science , power (physics) , algorithm , control theory (sociology) , arithmetic , mathematics , artificial intelligence , physics , quantum mechanics , economics , image (mathematics) , macroeconomics , programming language , control (management)
In this paper we report on a new recursive DCT architecture that is more efficient in terms of area and power in comparison to recently published recursive DCT architectures. Our approach here employs Type A, B and C Goertzel filters. These three different realizations of Goertzel filters together with multiplierless implementation of loop multiplications are used so as to reduce the area, the multiplier delay, and undesirable transitions hence the power consumption. The newly proposed DCT structure has been compared with conventional recursive implementations at different transform lengths to observe that there are potential savings both in area and power.