Share Email Print
cover

Proceedings Paper

True Radix-2 discrete cosine transform algorithm
Author(s): Hsieh-Sheng Hou
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper we present a true radix-2 discrete cosine transform (DCT) algorithm in both decimation-in-frequency and decimation-in-time forms. To date, there has been strong interest in developing new processing techniques in the DCT domain for the reason that the DCT is popularly used in the current international standards for image, audio, and video compression. One important function in this respect is to merge or split of DCT blocks in the transform domain. Though many fast DCT algorithms have been existed, they are not suitable for such application. Most of the existing fast DCT algorithms are in radix-2 form, of which the DCT matrix is factorized into two half-sized transform matrices. But these two sub-matrices are not the same, at the best only one is the lower order DCT. In other words, the existing fast DCT algorithms are not true radix-2. This in turn has prevented them from direct applications to the transform-domain processing. The true radix-2 DCT algorithm presented in this paper has alleviated the above difficulty, and it may provide new techniques for other potential applications.

Paper Details

Date Published: 7 December 2001
PDF: 12 pages
Proc. SPIE 4472, Applications of Digital Image Processing XXIV, (7 December 2001); doi: 10.1117/12.449792
Show Author Affiliations
Hsieh-Sheng Hou, The Aerospace Corp. (United States)


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

© SPIE. Terms of Use
Back to Top