- Research Article
- Open Access
Fast DCT-I, DCT-III, and DCT-IV via Moments
EURASIP Journal on Advances in Signal Processing volume 2005, Article number: 959583 (2005)
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.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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
Keywords and phrases
- discrete cosine transforms
- fast transform
- systolic array