ScholarLens Back to search
1987•IEEE Transactions on Acoustics Speech and Signal ProcessingRequires access

A fast recursive algorithm for computing the discrete cosine transform

Hsieh S. Hou

Open publisher page 407 citations

Abstract

The discrete cosine transform (DCT) is widely applied in various fields, including image data compression, because it operates like the Karhunen-Loève transform for stationary random data. This paper presents a recursive algorithm for DCT with a structure that 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.

About this research paper

What this paper is about

The discrete cosine transform (DCT) is widely applied in various fields, including image data compression, because it operates like the Karhunen-Loève transform for stationary random data. This paper presents a recursive algorithm for DCT with a structure that 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.

Why it matters

OpenAlex reports 407 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The discrete cosine transform (DCT) is widely applied in various fields, including image data compression, because it operates like the Karhunen-Loève transform for stationary random data. This paper presents a recursive algorithm for DCT with a structure that 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.

Key concepts: Discrete cosine transform, Algorithm, Data compression, Modified discrete cosine transform, Transform coding, Adder, Computer science, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A fast recursive algorithm for computing the discrete cosine transform — Research Paper | ScholarLens