论文信息 - A sequency-ordered fast Walsh transform

A sequency-ordered fast Walsh transform

A method is described that yields the fast Walsh transform (FWT) in sequency order. The advantages of this method over others are: 1) it is based on the Cooley-Tukey-type fast Hadamard transform (FHT) algorithm, 2) the computational effort is identical to the conventional FHT, and 3) the transform remains its own inverse.

J. Manz

[1] Keith W. Henderson,et al. Some Notes on the Walsh Functions , 1964, IEEE Trans. Electron. Comput..

[2] D. A. Bell. Walsh functions and Hadamard matrixes , 1966 .

[3] John L. Shanks,et al. Computation of the Fast Walsh-Fourier Transform , 1969, IEEE Transactions on Computers.

[4] Henning F. Harmuth,et al. Transmission of information by orthogonal functions , 1969 .

[5] C. K. Yuen. Walsh Functions and Gray Code , 1971 .

[6] Nasir Ahmed,et al. A generalized discrete transform , 1971 .