The Cascading Haar Wavelet algorithm for computing the Walsh-Hadamard Transform
A novel algorithm for computing the Walsh–Hadamard transform (WHT) is proposed, which consists entirely of Haar wavelet transforms. It is proved that the algorithm, referred to as the cascading Haar wavelet algorithm, shares precisely the same serial complexity as the popular divide-and-conquer algo...
Main Author: | Thompson, A |
---|---|
Format: | Journal article |
Published: |
IEEE
2017
|
Similar Items
-
Walsh - Hadamard Transformation of a Convolution
by: M. Zajac, et al.
Published: (2002-09-01) -
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
by: Cheraghchi, Mahdi, et al.
Published: (2018) -
Pauli decomposition via the fast Walsh-Hadamard transform
by: Timothy N Georges, et al.
Published: (2025-01-01) -
Computationally Efficient Robust Color Image Watermarking Using Fast Walsh Hadamard Transform
by: Suja Kalarikkal Pullayikodi, et al.
Published: (2017-10-01) -
Image Compression using Haar and Modified Haar Wavelet Transform
by: Mohannad Abid Shehab Ahmed, et al.
Published: (2011-06-01)