Journal article
The Cascading Haar Wavelet algorithm for computing the Walsh-Hadamard Transform
- Abstract:
- 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 algorithm for the WHT. A natural parallelization of the algorithm is also proposed, which has a number of attractive features.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 167.8KB, Terms of use)
-
- Publisher copy:
- 10.1109/LSP.2017.2705247
Authors
- Publisher:
- IEEE
- Journal:
- IEEE Signal Processing Letters More from this journal
- Volume:
- 24
- Issue:
- 7
- Pages:
- 1020-1023
- Publication date:
- 2017-05-17
- Acceptance date:
- 2017-05-10
- DOI:
- EISSN:
-
1558-2361
- ISSN:
-
1070-9908
- Keywords:
- Pubs id:
-
pubs:694284
- UUID:
-
uuid:66c93c8e-4f23-46fc-ae31-4d44ffcaec9a
- Local pid:
-
pubs:694284
- Source identifiers:
-
694284
- Deposit date:
-
2017-05-24
- ARK identifier:
Terms of use
- Copyright holder:
- IEEE
- Copyright date:
- 2017
- Notes:
- Copyright © 2017 IEEE. This is the accepted manuscript version of the article. The final version is available online from IEEE at: https://doi.org/10.1109/LSP.2017.2705247
If you are the owner of this record, you can report an update to it here: Report update to this record