计算机工程2011，Vol.37Issue(20)：30-32,3.DOI:10.3969/j.issn.1000-3428.2011.20.011
改进的Q-M逻辑函数化简方法
Improved Q-M Method for Simplification of Logic Functions
摘要
Abstract
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 implicates 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.关键词
逻辑函数化简/Q-M方法/质蕴涵项/二分图/最小覆盖Key words
simplification of logic functions/ Q-M method/ prime implicants/ bipartite graph/ minimum coverage分类
信息技术与安全科学引用本文复制引用
徐俊平,程利新..改进的Q-M逻辑函数化简方法[J].计算机工程,2011,37(20):30-32,3.基金项目
哈尔滨工程大学基础研究基金资助项目(HEUFT05069) （HEUFT05069）
