October 1, 1987

A fast recursive algorithm for computing the discrete cosine transform

Key Points

Key points are not available for this paper at this time.

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.

AI से पूछें

Bookmark

Cite This Study

Hsieh S. Hou (Thu,) studied this question.

synapsesocial.com/papers/6a0cd3e0ff9c20aeb34a4577 https://doi.org/https://doi.org/10.1109/tassp.1987.1165060

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

AI से पूछें

Bookmark