Abstract
Haar transforms are invertible transforms that do not involve trigonometric factors. We present several variants of the transform whose computation involve just O(n) operations. Haar transforms can be used as building blocks of the Walsh transform. We describe the prefix transform and its convolution, and give two non-standard splitting schemes for Haar transforms, based on the Fibonacci and Mersenne numbers.
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
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Arndt, J. (2011). The Haar transform. In: Matters Computational. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14764-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-14764-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14763-0
Online ISBN: 978-3-642-14764-7
eBook Packages: Computer ScienceComputer Science (R0)