论文标题
一种启发性的方法，以最小化的两级布尔来衍生自卡诺映射
A Heuristic Approach to Two Level Boolean Minimization Derived from Karnaugh Mapping
论文作者
论文摘要
以下论文提出了一种启发式方法，可以通过该方法来简化产品总和，以特定的重点是去除冗余和选择性质量隐含物。现有的方法，例如Karnaugh Map和Quine-McCluskey方法[1，2]，由于它们随着文字数量的增加而呈指数增长，因此无法进行扩展，因此这样做以确保算法获得算法。通过采用启发式模型，几乎所有表达式都可以在计算复杂性的总体降低时简化。这种新方法源自基本布尔法律，karnaugh映射以及真相表。
The following paper presents a heuristic method by which sum-of-product Boolean expressions can be simplified with a specific focus on the removal of redundant and selective prime implicants. Existing methods, such as the Karnaugh map and the Quine-McCluskey method [1, 2], fail to scale since they increase exponentially in complexity as the quantity of literals increases, doing as such to ensure the solution is algorithmically obtained. By employing a heuristic model, nearly all expressions can be simplified at an overall reduction in computational complexity. This new method was derived from the fundamental Boolean laws, Karnaugh mapping, as well as truth tables.
