Using symbolic Rademacher-Walsh spectral transforms to evaluate the agreement between Boolean functions

With the advent of symbolic techniques for Boolean and pseudoBoolean function manipulation, spectral transformations have become more relevant in the areas of logic synthesis and formal verification. The authors propose a symbolic algorithm based on algebraic decision diagrams, a data structure for the efficient manipulation of matrices and graphs, to compute the agreement between pairs of Boolean functions. Such an algorithm, operating in the transform domain, allows Boolean functions of over 80 input variables to be handled in a very short time