This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computation of the Fast Walsh-Fourier Transform
May 1969 (vol. 18 no. 5)
pp. 457-459
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
Usage of this product signifies your acceptance of the Terms of Use.