IEEE Transactions on Computers
A Simplified Definition of Walsh Functions
IEEE Transactions on Computers
Comment on "Computation of the Fast Walsh-Fourier Transform"1
IEEE Transactions on Computers
Computing Robust Walsh-Fourier Transform by Error Product Minimization
IEEE Transactions on Computers
Computation of the Hadamard Transform and the R- Transform in Ordered Form
IEEE Transactions on Computers
On the Fast Fourier Transform on Finite Abelian Groups
IEEE Transactions on Computers
A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms
IEEE Transactions on Computers
Comment on "Computation of the Fast Walsh-Fourier Transform"
IEEE Transactions on Computers
Composite Spectra and the Analysis of Switching Circuits
IEEE Transactions on Computers
Fast Hadamard Transform Using the H Diagram
IEEE Transactions on Computers
On Computation of the Hadamard Transform and the R Transform in Ordered Form
IEEE Transactions on Computers
Upper Bounds on Walsh Transforms
IEEE Transactions on Computers
Representing Images Using Nonorthogonal Haar-Like Bases
IEEE Transactions on Pattern Analysis and Machine Intelligence
A multidimensional linear distinguishing attack on the Shannon cipher
International Journal of Applied Cryptography
A Hybrid Walsh Transform Computer
IEEE Transactions on Computers
IEEE Transactions on Signal Processing
Counting Boolean functions with specified values in their Walsh spectrum
Journal of Computational and Applied Mathematics
| Hi-index | 15.02 |
The discrete, orthogonal Walsh functions can be generated by a multiplicative iteration equation. Using this iteration equation, an efficient Walsh transform computation algorithm is derived which is analogous to the Cooley-Tukey algorithm for the complex-exponential Fourier transform.