Abstract
This chapter presents algorithms to calculate transforms with wavelets introduced by Ingrid Daubechies. In contrast to Haar’s simple-step wavelets, which exhibit jump discontinuities, Daubechies wavelets are continuous. As a consequence of their continuity, Daubechies wavelets approximate continuous signals more accurately with fewer wavelets than do Haar’s wavelets, but at the cost of intricate algorithms based upon a sophisticated theory. Therefore, to ease the transition from Haar wavelets to Daubechies wavelets, the present material postpones to a subsequent chapter the theoretical considerations that led to such wavelets, and focuses first upon a description of algorithms to calculate the Daubechies wavelet transform. Some logical derivations involve matrix algebra.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nievergelt, Y. (1999). Algorithms for Daubechies Wavelets. In: Wavelets Made Easy. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0573-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0573-9_3
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6823-9
Online ISBN: 978-1-4612-0573-9
eBook Packages: Springer Book Archive