This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
February 1970 (vol. 19 no. 2)
pp. 174
R.J. Lechner, Sylvania Electronic Systems
J. L. Shanks1has given an algorithm for computing the discrete Walsh transform (abstract Fourier transform) of a sampled periodic function whose domain of definition is the set of integers modulo 2n. An algorithm of the same efficiency, using a much simpler notation, was given for the abstract Fourier transform in my correspondence published in 1963 in this TRANSACrIONS.2This transform has an identical matrix representation; the only difference is that the function domain is represented (for computation purposes) by binary coded representations of the integers from 0 to 2n-1. These binary n-tuples form a group under vector addition, modulo two.
Citation:
R.J. Lechner, "Comment on "Computation of the Fast Walsh-Fourier Transform"1," IEEE Transactions on Computers, vol. 19, no. 2, pp. 174, Feb. 1970, doi:10.1109/T-C.1970.222890
Usage of this product signifies your acceptance of the Terms of Use.