Disjunctive decomposition of switching functions using symmetry information

A new approach to a simple disjunctive decomposition of a Boolean function is presented. It is based on using symmetric relations among a function's variables to recognize intrinsic characteristics of the function. The conditions for the existence of a simple disjunctive decomposition are formulated and a hierarchical simple disjunctive decomposition is generated in a bottom-up manner without exhaustive search. Results on benchmark functions are very encouraging.