Characterizing and Enumerating Walsh-Hadamard Transform Algorithms

10/22/2017

∙

by   François Serre, et al.

∙

0

∙

share

We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies (I_2^n-1⊗DFT_2) interleaved by linear permutations. Linear permutations are those that map linearly the binary representation of its element indices. We also propose a method to enumerate these algorithms.