An algorithm for the calculation of generalized Walsh transform of Boolean functions

An efficient computer method for the calculation of the generalized Walsh transform of Boolean functions is shown. The method uses reduced representation of Boolean functions in the form of disjoint cubes, and avoids exponentially long minterm expressions which allows the calculation of the spectra of large Boolean functions. The algorithm can be parallelized or implemented in hardware.<
>