Abstract
This paper presents a new algorithm for two-level logic minimization. The new method is a bottom-up systemic melhodology 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 mlogm, 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 85% of the experiments for minimizing logic functions with more than 10 variables. This method can be used in conjuction with the Quines theorem to obtain the minimum cover with better time complexity.