A Fast Recursive Algorithm For Computing The Discrete Cosine Transform

H. S. Hou

doi:10.1117/12.976201

10 December 1986 A Fast Recursive Algorithm For Computing The Discrete Cosine Transform

H. S. Hou

Proceedings Volume 0697, Applications of Digital Image Processing IX; (1986) https://doi.org/10.1117/12.976201
Event: 30th Annual Technical Symposium, 1986, San Diego, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available