DocumentCode
1341371
Title
The binDCT: fast multiplierless approximation of the DCT
Author
Tran, Trac D.
Author_Institution
Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA
Volume
7
Issue
6
fYear
2000
fDate
6/1/2000 12:00:00 AM
Firstpage
141
Lastpage
144
Abstract
This paper presents a family of fast biorthogonal block transforms called binDCT that can be implemented using only shift and add operations. The transform is based on a VLSI-friendly lattice structure that robustly enforces both linear phase and perfect reconstruction properties. The lattice coefficients are parameterized as a series of dyadic lifting steps providing fast, efficient, in place computation of the transform coefficients as well as the ability to map integers to integers. The new 8/spl times/8 transforms all approximate the popular 8/spl times/8 DCT closely, attaining a coding gain range of 8.77-8.82 dB, despite requiring as low as 14 shifts and 31 additions per eight input samples. Application of the binDCT in both lossy and lossless image coding yields very competitive results compared to the performance of the original floating-point DCT.
Keywords
approximation theory; channel bank filters; discrete cosine transforms; image coding; lattice theory; linear phase filters; transform coding; DCT; VLSI-friendly lattice structure; binDCT; coding gain; dyadic lifting steps; fast biorthogonal block transform; fast multiplierless approximation; integer mapping; lattice coefficients; linear phase properties; lossless image coding; lossy image coding; perfect reconstruction properties; shift/add operations; Compaction; Discrete cosine transforms; Discrete transforms; Filter bank; Image coding; Karhunen-Loeve transforms; Lattices; Robustness; Transform coding; Video coding;
fLanguage
English
Journal_Title
Signal Processing Letters, IEEE
Publisher
ieee
ISSN
1070-9908
Type
jour
DOI
10.1109/97.844633
Filename
844633
Link To Document