|
|||||
|
|
| 逻辑函数绝对最小覆盖的改进算法 | |
| 引用本文： | 王波. 逻辑函数绝对最小覆盖的改进算法[J]. 南通工学院学报(社会科学版), 1998, 14(2): 41-47 |
| 作者姓名： | 王波 |
| 作者单位： | 南通工学院自动化系!南通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 Nantong University(Education Sciences Edition), 1998, 14(2): 41-47 | |
| Authors: | Wang Bo |
| Abstract: | This paper points Out that the requirements of too much processing time and memory space in the absolute minimization procedures are major problems. Presented is a new method to extract an absolute minimal cover from a given set of prime implicents with greatly reduced time and space requirement. |
| Keywords: | inclusion function presence factor unate variable ratio set |
| 本文献已被 CNKI 维普 等数据库收录！ | |