An algorithm to compute the sequency ordered Walsh transform

Abstract

A fast sequency ordered Walsh Transform algorithm is presented, which is the complement to one developed by Manz. It is in place, is its own inverse, and accepts data in normal order, returning the coefficients in bit-reversed sequency order.