Generalized Walsh transforms of Boolean functions
B.J. Falkowski · 2003
A theoretical formulation of the generalized Walsh transform targeting different gate implementations is presented. The formulation is based on a uniform representation of completely and incompletely specified Boolean functions by a set of orthogonal and generalized Walsh spectral coefficients. The computer implementation drastically reduces required computation time by making it possible to calculate only chosen coefficients in specified polarity. The entire spectrum, if required, can be computed incrementally for groups of coefficients.>