Abstract
Two-Dimensional Wavelet Transforms have proven to be highly effective tools for image analysis. In this paper, we present a VLSI implementation of four- and six-coefficient Daubechies Wavelet Transforms using an algebraic integer encoding representation for the coefficients. The Daubechies filters (DAUB4 and DAUB6) provide excellent spatial and spectral locality, properties which make it useful in image compression. In our algorithm, the algebraic integer representation of the wavelet coefficients provides error-free calculations until the final reconstruction step. This also makes the VLSI architecture simple, multiplication-free and inherently parallel. Compared to other DWT algorithms found in the literature, such as embedded zero-tree, recursive or semi-recursive, linear systolic arrays and conventional fixed-point binary architectures, it has reduced hardware cost, lower power dissipation and optimized data-bus utilization. The architecture is also cascadable for computation of one- or multi-dimensional Daubechies Discrete Wavelet Transforms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
