助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   karnaugh graph 的翻译结果: 查询用时:0.192秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

karnaugh graph
相关语句
  卡诺图
     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.
     这些方法可解决卡诺图所不能解决的多于六元的函数极小化问题,能应用于数码转换、数字控制、自动化装置的人工逻辑化简、计算机设计自动化。
短句来源
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     On X'-critical Graph
     边色数临界图
短句来源
     Axial Karnaugh Map
     轴式卡诺图
短句来源
     Inclusion Karnaugh Map
     包含卡诺图
短句来源
查询“karnaugh graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


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...

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 CJ-719.

本文建立了一种立方体图,无需分解单项式为最小项,能方便地解决单输出多元开关函数极小化问题。文中给出了无冗余覆盖及极小覆盖的求法,并称求极小覆盖的方法为“序号数组法”。这些方法可解决卡诺图所不能解决的多于六元的函数极小化问题,能应用于数码转换、数字控制、自动化装置的人工逻辑化简、计算机设计自动化。本方法已在CJ-719计算机上实现。

The fundamental principles of logic algebra are discussed. An encoding method to simplify logic algebra based on the Karnaugh Graph is proposed. The experiment results show that this method is accurate, efficient and can be widely used.

阐述了化简逻辑代数的基本原理,针对代数法和卡诺图法化简逻辑代数的不足,提出了一种软件化简逻辑代数的编码方案;详细地介绍了形式变换模块、扩充模块和化简模块的设计过程。通过实验可表明,用软件化简逻辑代数可使化简结果准确、算法高效、适用面广。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关karnaugh graph的内容
在知识搜索中查有关karnaugh graph的内容
在数字搜索中查有关karnaugh graph的内容
在概念知识元中查有关karnaugh graph的内容
在学术趋势中查有关karnaugh graph的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社