Spectral method of Boolean function complexity

A common measure of Boolean function complexity is transformed to the Rademacher/Walsh spectral domain. The resulting spectral measure has an appealing visual interpretation not found in the functional domain. The relevance of this spectral measure to spectral translation and to the testability of certain classes of combinational networks is examined.