| 逻辑函数绝对最小覆盖的改进算法 |
| |
| 引用本文： | 王波.逻辑函数绝对最小覆盖的改进算法[J].计算机辅助设计与图形学学报,1999,11(2):143-146. |
| |
| 作者姓名： | 王波 |
| |
| 作者单位： | 南通工学院自动化系,南通,226007 |
| |
| 摘 要： | 逻辑函数的绝对最小化算法存在的主要问题是运行时间过长和需要的存储空间过大。本文提出了一个从给定本源蕴涵项集合中抽出一个绝对最小覆盖的算法，而时间、空间的需求被大缩小了。
|
| 关 键 词： | 包含函数 出现因子 单边变量 比率集合 |
AN IMPROVED METHOD TO EXTRACT ABSOLUTE MINIMAL COVERS FOR LOGIC FUNCTIONS |
| |
| WANG Bo.AN IMPROVED METHOD TO EXTRACT ABSOLUTE MINIMAL COVERS FOR LOGIC FUNCTIONS[J].Journal of Computer-Aided Design & Computer Graphics,1999,11(2):143-146. |
| |
| Authors: | WANG Bo |
| |
| Affiliation: | WANG Bo;
( |
| |
| Abstract: | In absolute minimization procedures for logic functions,the excessively long processing time and excessively large memory space requirement are major problems to overcome. This paper presents a new method to extract an absolute minimal cover from a given set of prime implicants with greatly reduced time and space requirement. |
| |
| Keywords: | inclusion function presence factor unate variable ratio set |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
