Approximating the DCT with the lifting scheme: systematic design and applications

Author

Liang, Jie ; Tran, Trac D.

Author_Institution

Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA

Volume

1

fYear

2000

fDate

Oct. 29 2000-Nov. 1 2000

Firstpage

192

Abstract

A systematic approach to design two families of multiplierless approximations of the DCT with the lifting scheme is presented, based on Chen´s (1977) and Loeffler´s (1989) factorizations of the DCT matrix, respectively. The analytical values of all the lifting steps are derived, which can be approximated by dyadic values to enable fast implementations with only shifts and additions. Different trade-offs between the complexity and the performance can be easily obtained. A scaled lifting structure is proposed to further reduce its complexity. The performance of the lifting-based DCT implementation is demonstrated in the frameworks of JPEG and H.263+. Besides, the lossless compression capability is also presented.

Keywords

approximation theory; code standards; computational complexity; data compression; discrete cosine transforms; image coding; matrix decomposition; telecommunication standards; transform coding; DCT approximation; DCT matrix factorization; H.263+; JPEG; additions; complexity reduction; image coding; image compression standards; lifting scheme; lifting-based DCT implementation; lossless compression; multiplierless approximations; performance; scaled lifting structure; shifts; systematic design; video compression standards; Application software; Discrete cosine transforms; Discrete transforms; Image coding; Marine vehicles; Quantization; Sparse matrices; Transform coding; Video coding; Video compression;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 2000. Conference Record of the Thirty-Fourth Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-7803-6514-3

Type

conf

DOI

10.1109/ACSSC.2000.910943

Filename

910943