| 逻辑函数化简语义树 |
| |
| 引用本文： | 王杰华,王波.逻辑函数化简语义树[J].微电子学,1998,28(5):365-368. |
| |
| 作者姓名： | 王杰华 王波 |
| |
| 作者单位： | 南通工学院 |
| |
| 基金项目： | 南通工学院自然科学基金 |
| |
| 摘 要： | 提出了一种逻辑函数化简语义树算法，其特点是在求全部本源蕴涵项和从本源蕴函项集合中选取最小覆盖两步中都采用同一算法，因此，算法程序的编写可较为简单，最后，从解题质量和解题速度等方面对该算法进行了评价。
|
| 关 键 词： | 计算机辅助设计 语义树 逻辑函数最小化 |
A Semantic Tree for Boolean Function Simplification |
| |
| WANG Jie Hua and WANG Bo Nantong Institute of Technology,Nantong,Jiangsu.A Semantic Tree for Boolean Function Simplification[J].Microelectronics,1998,28(5):365-368. |
| |
| Authors: | WANG Jie Hua and WANG Bo Nantong Institute of Technology Nantong Jiangsu |
| |
| Affiliation: | WANG Jie Hua and WANG Bo Nantong Institute of Technology,Nantong,Jiangsu 226007 |
| |
| Abstract: | An algorithm for logic function minimization called semantic tree is reported in the paper.A distinguished characteristic of the algorithm is that it uses the unifying method to generate prime implicants and derive an absolute minimal cover from the prime implicants.So,programming for the algorithm is relatively simple.The algorithm is evaluated with regard to the quality and operation time of its solution. |
| |
| Keywords: | CAD Algorithm Semantic tree Logic function minimization Prime implicant |
| 本文献已被 CNKI 维普 等数据库收录！ |
