Fast Walsh–Hadamard transform
In computational mathematics, the Hadamard ordered fast Walsh–Hadamard transform (FWHTh) is an efficient algorithm to compute the Walsh–Hadamard transform (WHT). A naive implementation of the WHT would have a computational complexity of O(). The FWHTh requires only additions or subtractions.
The normalization factors for each stage may be grouped together or even omitted.
The sequency ordered, also known as Walsh ordered, fast Walsh–Hadamard transform, FWHTw, is obtained by computing the FWHTh as above, and then rearranging the outputs.
||This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (September 2015) (Learn how and when to remove this template message)|
- Fino, B. J.; Algazi, V. R. (1976). "Unified Matrix Treatment of the Fast Walsh–Hadamard Transform". IEEE Transactions on Computers. 25 (11): 1142–1146. doi:10.1109/TC.1976.1674569.
- Charles Constantine Gumas, 
|This signal processing-related article is a stub. You can help Wikipedia by expanding it.|
|This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.|