Graphical preprocessing of orderings used in disjunctive decomposition detection

A graphical analysis is presented to predict the input variable subsets that give efficient disjunctive decompositions of complex combinatorial logic functions. The subsets obtained match substantially with the optimum orderings from an exhaustive search for disjunctive decompositions, thus, the technique can serve as a preprocessor before exhaustive search algorithms.