Fast algorithms for Walsh transform in bit-reversed sequency order

Bit-reversed sequenry order or bit-reversed Walsh order (M) is presented. Walsh functions in this order can be processed cnsily, and there is a simple relation between sequency order and bit-reversed sequency order. 8 fast algorithms for discrete Walsh transform in bit-reversed sequency order are given.