| Quine-McClusky法的改进 |
| |
| 引用本文： | 左全生.Quine-McClusky法的改进[J].常州工学院学报,2007,20(3):31-34. |
| |
| 作者姓名： | 左全生 |
| |
| 作者单位： | 常州工学院电子信息与电气工程学院,江苏,常州,213002 |
| |
| 摘 要： | 文章提出了Quine-McClusky法的一种改进,该方法特别适合于有大量约束项的组合逻辑电路设计。这一改进方法,可以大大减少组合逻辑电路所需要的门电路。
|
| 关 键 词： | Quine-McClusky法 约束条件 组合逻辑电路设计 |
| 文章编号： | 1671-0436（2007）03-0031-04 |
| 收稿时间： | 2007-05-09 |
| 修稿时间： | 2007-05-09 |
A Modified Method about Quine-McClusky Algorithm |
| |
| ZUO Quan-sheng.A Modified Method about Quine-McClusky Algorithm[J].Journal of Changzhou Institute of Technology,2007,20(3):31-34. |
| |
| Authors: | ZUO Quan-sheng |
| |
| Abstract: | This paper proposes a modified method about Quine-McClusky algorithm,which is proper for those combinational-circuit syntheses that have many constraint terms.According to this method we can minimize a combinational circuit by reducing the number and size of gates that are needed to build it. |
| |
| Keywords: | Quine-McClusky algorithm constraint term combinational-circuit synthesis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
