计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (10): 60-62.

• 学术探讨 • 上一篇    下一篇

逻辑函数无冗余覆盖选择问题

张义清 管致锦 吕彦明 李洵   

  1. 南通工学院 南通工学院
  • 收稿日期:2006-04-26 修回日期:1900-01-01 出版日期:2007-04-01 发布日期:2007-04-01
  • 通讯作者: 管致锦

The Selection of Irredundant Cover for Logic Function

Zhijin Guan   

  • Received:2006-04-26 Revised:1900-01-01 Online:2007-04-01 Published:2007-04-01
  • Contact: Zhijin Guan

摘要: 逻辑函数的最小化算法可以分为两大步骤,产生本源蕴涵项和在这些蕴涵项中选择一个最小覆盖。提出一个适于大变量输入输出逻辑函数的实质项与相对冗余项的识别和选择近似最小覆盖的算法。Benchmark例题测试表明,算法具有理想的处理效果。

Abstract: Minimization algorithms of logic function involve two main steps: generation of prime implicants 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 redundances R and relative redundances 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.