A Sequency-Ordered Fast Walsh Transform

Manz, Joseph W.
Student Member, IEEE


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 Cooky-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.


Post a Comment