立方体图及开关函数极小化
Cubic Graph and Minimization of Switching Function
-
摘要: 本文建立了一种立方体图,无需分解单项式为最小项,能方便地解决单输出多元开关函 数极小化问题.文中给出了无冗余覆盖及极小覆盖的求法,并称求极小覆盖的方法为“序号 数组法”.这些方法可解决卡诺图所不能解决的多于六元的函数极小化问题,能应用于数码转 换、数字控制、自动化装置的人工逻辑化简、计算机设计自动化.本方法已在cJ-719计算机 上实现.Abstract: This paper presents a cubic graph by which it is unnecessary to decompose each monomial into miniterms for minimizing multivariate switching functions of single-output. The method for obtaining "non-redundant" cover and the method which is called "orded array method" for finding "minimal" cover are also presented; The minimization of switching functions with more than six variables that cannot be solved by Karnaugh graph, may be solved by these methods. Souch methods can be applied to the simplification of logic circuits, digital control etc. The algorithms presented in this paper has been implemented on the computer C'J-719.
-
计量
- 文章访问数: 1264
- HTML全文浏览量: 153
- PDF下载量: 933
- 被引次数: 0
下载:
