Improved Q-M Method for Simplification of Logic Functions
Cheng Li-xin · Jisuanji gongcheng · 2011
In order to improve the simplification speed of logic functions,this paper proposes an improved Q-M method for simplification of logic functions.The size of implicants set is decreased by using a pair of weights in the iteration process of comparison,only the implicants which satisfy the conditions is merged.And all prime implicants are obtained at last.Bipartite graph which is consists of prime implications and minterms is structured.The least prime implicants containing all of the minterns,that is,the minimum coverage of logic functions is obtained by heuristic approach.Experimental results show that the number of iterations can be reduced,and the speed of simplification can be accelerated.