Skip to main content

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

Abstract

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.

Author information

Affiliations

Authors

Corresponding author

Correspondence to J. G. Liu.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Liu, J.G., Liu, Y.Z. & Wang, G.Y. Fast DCT-I, DCT-III, and DCT-IV via Moments. EURASIP J. Adv. Signal Process. 2005, 959583 (2005). https://doi.org/10.1155/ASP.2005.1902

Download citation

Keywords and phrases

  • discrete cosine transforms
  • moment
  • fast transform
  • systolic array
\