The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1969 vol.18)
pp: 457-459
ABSTRACT
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.
INDEX TERMS
Algorithm, Cooley-Tukey, Hadamard-Fourier, orthogonal, transform, Walsh-Fourier.
CITATION
J.L. Shanks, "Computation of the Fast Walsh-Fourier Transform", IEEE Transactions on Computers, vol.18, no. 5, pp. 457-459, May 1969, doi:10.1109/T-C.1969.222685
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool