Share Email Print

Proceedings Paper

Fast multiplierless approximation of the DCT with the lifting scheme
Author(s): Jie Liang; Trac D. Tran
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

In this paper, we present a systematic approach to design two families of fast multiplierless approximations of the DCT with the lifting scheme, based on two kinds of factorizations of the DCT matrix with Givens rotations. A scaled lifting structure is proposed to reduce the complexity of the transform. Analytical values of all lifting parameters are derived, from which dyadic values with different accuracies can be obtained through finite-length approximations. This enables low-cost and fast implementations with only shift and addition operations. Besides, a sensitivity analysis is developed for the scaled lifting structure, which shows that for certain rotation angles, a permuted version of it is more robust to truncation errors. Numerous approximation examples with different complexities are presented for the 8-point and 16-point DCT. As the complexity increases, more accurate approximation of the floating DCT can be obtained in terms of coding gains, frequency responses, and mean square errors of DCT coefficients. Hence the lifting-based fast transform can be easily tailored to meet the demands of different applications, making it suitable for hardware and software implementations in real-time and mobile computing applications.

Paper Details

Date Published: 28 December 2000
PDF: 12 pages
Proc. SPIE 4115, Applications of Digital Image Processing XXIII, (28 December 2000); doi: 10.1117/12.411606
Show Author Affiliations
Jie Liang, Johns Hopkins Univ. (United States)
Trac D. Tran, Johns Hopkins Univ. (United States)

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

© SPIE. Terms of Use
Back to Top