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. © 2005 Hindawi Publishing Corporation.
Author supplied keywords
Cite
CITATION STYLE
Liu, J. G., Liu, Y. Z., & Wang, G. Y. (2005). Fast DCT-I, DCT-III, and DCT-IV via Moments. Eurasip Journal on Applied Signal Processing, 2005(12), 1902–1909. https://doi.org/10.1155/ASP.2005.1902
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
