Algorithm and architecture for Gray code ordered fast Walsh transform
B.J. Falkowski, Marek A. Perkowski · 2002
The generation of two new Walsh transforms in Gray code orderings from the straight binary code is shown. A recursive algorithm for Gray-code-ordered Walsh transforms is based on a novel operator called the bisymmetrical pseudo Kronecker product. The recursive algorithm is the basis for the flow diagram of a constant geometry fast Walsh transform in Gray code ordering. The algorithm is fast (N log/sub 2/ N additions/subtractions), is computer efficient, and is implemented in the iterative architecture.>