Share Email Print

Proceedings Paper

Multiplication-free architecture for Daubechies wavelet transforms using algebraic integers
Author(s): Khan Wahid; Vassil Dimitrov; Graham A. Jullien
Format Member Price Non-Member Price
PDF $17.00 $21.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

The 2-Dimensional Wavelet Transform has been proven to be a highly effective tool for image analysis and used in JPEG2000 standard. There are many publications which demonstrate that using wavelet transform in time and space, combined with a multiresolution approach, leads to an efficient and effective method of compression. In particular, the four and six coefficient Daubechies filters have excellent spatial and spectral locality, properties which make them useful in image compression. In this paper, we propose a multiplication-free and parallel VLSI architecture for Daubechies wavelets where the computations are free from round-off errors until the final reconstruction step. In our algorithm, error-free calculations are achieved by the use of Algebraic Integer encoding of the wavelet coefficients. Compared to other DWT algorithms such as: embedded zero-tree, recursive or semi-recursive and conventional fixed-point binary architecture, our technique has lower hardware cost, lower computational power and optimized data-bus utilization.

Paper Details

Date Published: 24 December 2003
PDF: 10 pages
Proc. SPIE 5205, Advanced Signal Processing Algorithms, Architectures, and Implementations XIII, (24 December 2003); doi: 10.1117/12.506640
Show Author Affiliations
Khan Wahid, Univ. of Calgary (Canada)
Vassil Dimitrov, Univ. of Calgary (Canada)
Graham A. Jullien, Univ. of Calgary (Canada)

Published in SPIE Proceedings Vol. 5205:
Advanced Signal Processing Algorithms, Architectures, and Implementations XIII
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top