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...
Autor principal: | Thompson, A |
---|---|
Formato: | Journal article |
Publicado: |
IEEE
2017
|
Ejemplares similares
-
Walsh - Hadamard Transformation of a Convolution
por: M. Zajac, et al.
Publicado: (2002-09-01) -
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
por: Cheraghchi, Mahdi, et al.
Publicado: (2018) -
Pauli decomposition via the fast Walsh-Hadamard transform
por: Timothy N Georges, et al.
Publicado: (2025-01-01) -
Computationally Efficient Robust Color Image Watermarking Using Fast Walsh Hadamard Transform
por: Suja Kalarikkal Pullayikodi, et al.
Publicado: (2017-10-01) -
Image Compression using Haar and Modified Haar Wavelet Transform
por: Mohannad Abid Shehab Ahmed, et al.
Publicado: (2011-06-01)