本文提出组合逻辑函数简化的动态极大复盖法。
Dynamic max-covering method for simplifying combinational logic functions is presented in this paper.
结论用MSI数据选择器可实现任意组合逻辑函数。
Conclusion Using MSI data selector can implement any combined logic functions.
阐述了如何实现组合逻辑函数，并对实现方法进行了分析与比较，指出了一种行之有效的方法。
It also discusses how to realize composite logic function, analyses, compares these methods, and puts forward an effective one.
目的讨论用中规模器件实现组合逻辑函数时，函数变量数小于数据选择器的地址变量数的情况。
Aim When using moderate dimension of apparatus to realize combined logic function, the instance which function variable Numbers is less than the address of data selector is discussed.
介绍了用中规模集成电路数据选择器实现组合逻辑函数的三种方法：常用方法、扩展法、降维法。
This paper introduces three methods to realize composite logic function with medium - scale data selector: the common method, the expanding method and the dimension - reducing method.
逻辑综合的功能是对组合逻辑函数的描述进行转换和优化，生成与逻辑功能描述等价的优化的逻辑级纯结构描述。
Functions of logic synthesis are to transform and optimize the combinational logic functions and produce the pure logic level structural description.
运用粗集理论对逻辑函数进行知识表达的方法，提出了基于粗糙集的组合逻辑优化方法，并给出了相应的算法。
Rough set-based method of combinatory logic optimization was presented by using knowledge expression of logic function with rough set theory, and its corresponding algorithm was given, also.
仿真实验结果证明了改进演化算法对于实现函数级数字组合逻辑电路的硬件演化是可行的，并且提高了演化算法的演化效率和收敛性能。
The results of simulation prove that the improved algorithms are feasible for evolving the digital combinational logic circuits and improve the evolvable efficiency and convergence performance.
提出了基于粗糙集理论对逻辑函数进行知识表达的方法，给出了运用粗糙集进行组合逻辑化简的优化算法。
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.
文章提出了基于粗糙集的多输出逻辑函数优化方法，并给出了相应算法；实例验证表明，基于粗糙集的组合逻辑优化方法是可行和有效的。
Through examples it proves that the optimal method of the combinational logic based on the rough set is both feasible and effective.
文章提出了基于粗糙集的多输出逻辑函数优化方法，并给出了相应算法；实例验证表明，基于粗糙集的组合逻辑优化方法是可行和有效的。
Through examples it proves that the optimal method of the combinational logic based on the rough set is both feasible and effective.
应用推荐