Open Access Research Article

Fast DCT-I, DCT-III, and DCT-IV via Moments

JG Liu1*, YZ Liu2 and GY Wang1

Author Affiliations

1 Key Laboratory of Education Ministry for Image Processing and Intelligence Control, Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science & Technology, Wuhan 430074, China

2 Department of Computer Science and Engineering, China University of Geosciences, Wuhan 430074, China

For all author emails, please log on.

EURASIP Journal on Advances in Signal Processing 2005, 2005:959583  doi:10.1155/ASP.2005.1902


The electronic version of this article is the complete one and can be found online at: http://asp.eurasipjournals.com/content/2005/12/959583


Received: 3 December 2003
Revisions received: 16 October 2004
Published: 28 July 2005

© 2005 Liu et al.

This paper presents a novel approach to compute DCT-I, DCT-III, and DCT-IV. By using a modular mapping and truncating, DCTs are approximated by linear sums of discrete moments computed fast only through additions. This enables us to use computational techniques developed for computing moments to compute DCTs efficiently. We demonstrate this by applying our earlier systolic solution to this problem. The method can also be applied to multidimensional DCTs as well as their inverses.

Keywords:
discrete cosine transforms; moment; fast transform; systolic array

Research Article