Fast Walsh-Hadamard Transform
No License
The function implement the 1D sequency(Walsh) ordered fast Walsh-Hadamard transform which can be used in signal processing, pattern recongnition and Genetic alogorithms.
This algorithm uses a Cooley-Tukey type signal flow graph and is implemented in N log2 N additions and subtractions. Data sequence length must be an integer power of 2.
The inverse transform is the same as the forward transform except for the multiplication factor N. This can be easily achieved by deleting the last line i.e. x=inv(N)*x;
Example:
x=[1 2 1 1];
W=FWHT(x);
Cite As
Dr. Gylson Thomas (2024). Fast Walsh-Hadamard Transform (https://www.mathworks.com/matlabcentral/fileexchange/6879-fast-walsh-hadamard-transform), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- Signal Processing > Signal Processing Toolbox > Transforms, Correlation, and Modeling > Transforms > Hilbert and Walsh-Hadamard Transforms >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 | As per the 9th review comment, in order to avoid signal processing toolbox, the bitrevorder function is also incorporated along with the main source code. |