Translator Disclaimer
10 December 1986 A Fast Recursive Algorithm For Computing The Discrete Cosine Transform
Author Affiliations +
Abstract
The Discrete Cosine Transform (DCT) has found wide applications in various fields, including image data compression, because it operates like the Karhunen-Loeve Transform for stationary random data. This paper presents a recursive algorithm for DCT whose structure allows the generation of the next higher-order DCT from two identical lower order DCT's. As a result, the method for implementing this recursive DCT requires fewer multipliers and adders than other DCT algorithms.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
H. S. Hou "A Fast Recursive Algorithm For Computing The Discrete Cosine Transform", Proc. SPIE 0697, Applications of Digital Image Processing IX, (10 December 1986); https://doi.org/10.1117/12.976201
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Recursive scaled DCT
Proceedings of SPIE (November 30 1991)
New fast DCT algorithms based on Loeffler's factorization
Proceedings of SPIE (October 14 2012)
Fast DCT block smoothing algorithm
Proceedings of SPIE (April 20 1995)

Back to Top