Share Email Print
cover

Proceedings Paper

Direct Computation Of Higher-Order Dct Coefficients From Lower-Order Dct Coefficients
Author(s): Bayesteh G. Kashef; Ali Habibi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

An efficient algorithm is proposed that computes the coefficients of a higher-order discrete cosine transform (DOT) from the coefficients of a lower-order DCT. The main feature of this algorithm is that it calculates the DCT coefficients of the larger block sizes from the DCT coefficients of smaller block sizes without any need to generate the inverse DCT. It is more efficient than the standard approach, which involves an inverse as well as DCT, if the standard fast-Fourier transform (FFT) procedure is used. However, it is not as efficient as the standard procedure if DCT and IDCT are generated using the newly discovered Winograd Fourier transform algorithm. This paper develops the computational algorithm for the one-dimensional DCT, then extends it to the two-dimensional DCT.

Paper Details

Date Published: 4 December 1984
PDF: 7 pages
Proc. SPIE 0504, Applications of Digital Image Processing VII, (4 December 1984); doi: 10.1117/12.944892
Show Author Affiliations
Bayesteh G. Kashef, The Aerospace Corporation (United States)
Ali Habibi, The Aerospace Corporation (United States)


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

© SPIE. Terms of Use
Back to Top