Algorithmcore
Fast Walsh-Hadamard transform
Also called FWHT, fast Hadamard transform.
In-place butterfly computation of the WHT in O(n log n) additions and subtractions.
In-place butterfly computation of the WHT in O(n log n) additions and subtractions.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag E3XY86 Edit this page History Report an error