Share Email Print

Proceedings Paper

A Fast Recursive Algorithm For Computing The Discrete Cosine Transform
Author(s): H. S. Hou
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 10 December 1986
PDF: 12 pages
Proc. SPIE 0697, Applications of Digital Image Processing IX, (10 December 1986); doi: 10.1117/12.976201
Show Author Affiliations
H. S. Hou, The Aerospace Corporation (United States)

Published in SPIE Proceedings Vol. 0697:
Applications of Digital Image Processing IX
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top