Issue No. 05 - May (1969 vol. 18)
J.L. Shanks , IEEE
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.
Algorithm, Cooley-Tukey, Hadamard-Fourier, orthogonal, transform, Walsh-Fourier.
J. Shanks, "Computation of the Fast Walsh-Fourier Transform," in IEEE Transactions on Computers, vol. 18, no. , pp. 457-459, 1969.