Disjoint decomposition of Boolean functions
Jörg Poswig · IEE Proceedings E Computers and Digital Techniques · 1991
The minimisation of Boolean functions is a classical problem. This paper deals with the set of functions which satisfy the equation f(X) = h(g(X1, X2 where the variable set X is given by the disjoint union of any sets X1 and X2 We present an efficient method in the Boolean domain which is based on the theory of Boolean differential calculus and the spectral development using the Walsh transform.