通过实例介绍了用降维卡诺图表示和化简逻辑函数的方法。
Through examples, this paper has explained the method to represent and simplify logic functions with dimension lowered Karnaugh maps.
本文在逻辑函数简化规则及其性质的基础上，提出了化简逻辑函数的一个新的方法——拓扑法。
Based on the rules and natures of simplifying logical function, a new topological method is presented to simplify logical function.
本文阐述了变量卡诺图和函数卡诺图的实用画法；推出了用卡诺图表示和化简逻辑函数的简捷方法。
This article describes the useful graphic representation of variables and functions' Karnaugh map, inferred a concise method to show and simplify the logical functions with the Karnaugh map.
讨论了逻辑函数卡诺图化简的计算机实现，提出了基于最大覆盖的问题求解方法。
According to different methods of simplifying logic function, this thesis discussed the method of simplifying Karnaugh map by using computer.
基于真值表和卡诺图的等价性，本文提出一种基于真值表搜索的逻辑函数自动化简方法。
Based on the equivalence of the true table and Karnaugh map, a novel general method of simplifying logical functions is proposed in this paper.
降维图可作为化简多变量逻辑函数、设计逻辑电路的一种方法。
The Reduced-Dimension Map can be used as a means to simplify the multiple variable logical function and to design logic circuit.
在此基础上提出了基于K图的逻辑函数oc展开式在固定极性下化简的新方法。
Based on it, a graphic method simplifying the OR-Coincidence (OC) expansions of a logic function under fixed polarity by using K-map is presented.
提出了一种逻辑函数化简语义树算法。
An algorithm for logic function minimization called semantic tree is reported in the paper.
卡诺图化简仅适用于四个及四个变量以下的逻辑函数的化简。
The method, using Carnon Illustration making the logic function to be simple, is to suit no moue four variables.
这里介绍一种对于任意变量逻辑函数的卡诺图表示及化简方案。
This is to illustrate a new method used in reducing Boolean expression which contains random variables.
逻辑函数常用的化简方法有两种，即公式法和图形法。
The common methods for simplifying the logic function are two:one formula method, another figure method.
提出了基于粗糙集理论对逻辑函数进行知识表达的方法，给出了运用粗糙集进行组合逻辑化简的优化算法。
A method of knowledge expression on based rough set theory for logic function is proposed. A minimization algorithm of simplifying logic function by using rough set is given.
针对代数法和卡诺图法难以化简规模很大的逻辑函数问题，提出使用蚁群算法处理大规模逻辑函数化简。
As algebra way and map way can not simplify the given large scale logical function, a new way using Ant Colony Algorithm to simplify large scale logical function is put forward.
讨论了布尔减和布尔除的定义以及逻辑函数在布尔减及非运算、布尔除及非运算完备集中的展开，给出了减-非和除-非逻辑函数的化简公式。
This paper discusses the definitions of Boolean subtraction and division, and the expansions of logic functions in Boolean subtraction- NOT and division- NOT complete sets.
讨论了逻辑函数卡诺图化简的计算机实现，提出了基于最大覆盖的问题求解方法。
In order to simplify Karnaugh map this thesis presents a method based on the maximum coverage.
探讨了卡诺图化简异或逻辑函数的原理，提出了化简异或逻辑函数的新方法。
The principle of using karnaugh maps to simplify XOR logical functions is explored.
在用中规模集成逻辑电路实现函数时，使用降维卡诺图可化简多变量函数。
When using MSI to implement logical functions, we can use Reduced-dimension Karnaugh Map (RDM) to simplify multi-variable functions.
本文提出一种线形对折法对逻辑函数的化简，所化简的函数能解决逻辑电路中的冒险问题，并能得到广泛的应用。
This paper gives a simplification of logic functions by means of a linear folding. The simplified functions can solve adventure problems existing in the logic circuit, and get a wide application.
本文提出一种线形对折法对逻辑函数的化简，所化简的函数能解决逻辑电路中的冒险问题，并能得到广泛的应用。
This paper gives a simplification of logic functions by means of a linear folding. The simplified functions can solve adventure problems existing in the logic circuit, and get a wide application.
应用推荐