Introduction to matrix analysis (2nd ed.)
Introduction to matrix analysis (2nd ed.)
Computation of the Fast Walsh-Fourier Transform
IEEE Transactions on Computers
Comment on "Computation of the Fast Walsh-Fourier Transform"
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.