A new method for two-level logic minimization

This paper presents a new algorithm for two-level logic minimization. The new method is a bottom-up systematic methodology that produces a minimal function. It is especially useful for of logic functions with large number of variables. The complexity of this algorithm is in the order of m log m, where m is the number of minterms in the logic function. Experimental results show that the proposed method produces the minimum cover in almost 99% of the experiments for minimizing logic functions with less than 10 variables. Also, experimental results show that the proposed method produces the minimum cover in almost 83% of the experiments for minimizing logic functions with more than 10 variables. This method can be used in conjunction with the Quine´s theorem to obtain the minimum cover with better time complexity.