Computation of the Fast Walsh-Fourier Transform
John L. Shanks · IEEE Transactions on Computers · 1969
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.