= Fast Walsh–Hadamard transform
{wiki=Fast_Walsh–Hadamard_transform}
The Fast Walsh–Hadamard Transform (FWHT) is an efficient algorithm for computing the Walsh–Hadamard Transform (WHT), which is a linear transform widely used in signal processing, data analysis, and various applications in computer science and engineering. The WHT is similar to the well-known Fourier Transform but operates over a different basis, specifically using the Walsh functions instead of complex exponentials.
Back to article page