Synthesis of single output, incompletely specified logic functions for two-level implementation

An algorithm for two-level logic minimization is described. The approach differs from most of the procedures presented in the past; in fact, rather than generating all the prime implicants of the function to be minimized, and then deriving a prime implicant covering set, it derives such a set directly from the minterm specification of the function by generating only the prime implicants involved in the covering problem. The procedure produces a near optimal two-level realization of the original function. Experimental results obtained on a set of benchmark functions show the effectiveness of the algorithm