| 逻辑函数无冗余覆盖选择问题 |
| |
| 引用本文： | 张义清,管致锦,吕彦明,李洵.逻辑函数无冗余覆盖选择问题[J].计算机工程与应用,2007,43(10):60-62,95. |
| |
| 作者姓名： | 张义清 管致锦 吕彦明 李洵 |
| |
| 作者单位： | [1]南通大学理学院,江苏南通226004 [2]南京航空航天大学信息科学与技术学院,南京210016 |
| |
| 摘 要： | 逻辑函数的最小化算法可以分为两大步骤,产生本源蕴涵项和在这些蕴涵项中选择一个最小覆盖。提出一个适于大变量输入输出逻辑函数的实质项与相对冗余项的识别和选择近似最小覆盖的算法。Benchmark例题测试表明,算法具有理想的处理效果。
|
| 关 键 词： | 余因子 列覆盖 无冗余覆盖 |
| 文章编号： | 1002-8331（2007）10-0060-03 |
| 修稿时间： | 2006-08 |
Selection of irredundant cover for logic function |
| |
| ZHANG Yi-qing,GUAN Zhi-jin,LV Yan-ming,LI Xun.Selection of irredundant cover for logic function[J].Computer Engineering and Applications,2007,43(10):60-62,95. |
| |
| Authors: | ZHANG Yi-qing GUAN Zhi-jin LV Yan-ming LI Xun |
| |
| Affiliation: | 1.College of Science, Nantong University, Nantong, Jiangsu 226004, China ;2.College of Information Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China |
| |
| Abstract: | Minimization algorithms of logic function involve two main steps:generation of prime implicate and extraction of a minimal cover from those primes.It is said that the second step is more difficult than the first one,and it is true.We present a method for eliminating irredundant terms and selecting a near minimal cover with acceptable complexity.Given G,a prime cover of function F,first,we divide G into three subsets:essential primes E,complete redundancies R and relative redundancies P.Then we select a subset P* from P such that P*∪E is a near minimal cover of F.Clearly,the later step is much more complex than the former.And this is why the discussion is mostly on it. |
| |
| Keywords: | cofactor column covering irredundant cover |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
