Translator Disclaimer
4 December 1984 Direct Computation Of Higher-Order Dct Coefficients From Lower-Order Dct Coefficients
Author Affiliations +
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.
© (1984) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bayesteh G. Kashef and Ali Habibi "Direct Computation Of Higher-Order Dct Coefficients From Lower-Order Dct Coefficients", Proc. SPIE 0504, Applications of Digital Image Processing VII, (4 December 1984);


Recursive scaled DCT
Proceedings of SPIE (November 30 1991)
Recursive Transforms In Hybrid Processing
Proceedings of SPIE (October 14 1986)
Signal Reconstruction From Fourier Transform Amplitude
Proceedings of SPIE (March 16 1983)
The Fast Hartley Transform
Proceedings of SPIE (December 18 1985)

Back to Top