数字多路选择器树形网络设计理论和算法

Theory and Algorithm for the Design of Digital Multiplexer Tree-Type Networks

利用多路选择器网络可以实现任意逻辑函数的原理和布尔代数运算,提出了基于逻辑函数不相交的简化的积之和形式的数字多路选择器树形网络设计的一种代数方法,该方法可以使待设计的数字多路选择器网络化简到最小树形网络。给出的设计实例说明了该方法是有效的,容易实现数字多路选择器网络的自动综合。

In this paper, an algebraic method for the design of digital multiplexer tree-type networks based on disjoint reduced sum-of-products forms of logic functions is presented by using principle realizing any logic function with multiplexer network and Boolean algebraic operations. By using the method, the digital multiplexer networks can be simplified to minimal tree-type networks. The example given in the paper shows the method is effective. Using the method, digital multiplexer network iogical synthesis can easily be accomplished automatically on a computer.