Neural network analysis for the identification of optimal variable orderings in the decomposition of complex logic functions

An artificial neural network 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. The subsets reveal significantly scaled down numbers of orderings in the search domain. The technique can thus serve as a pre-processor of comprehensive exhaustive search algorithms.