A Fast Recursive Algorithm For Computing The Discrete Cosine Transform

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 SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.