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 logical synthesis can easily be accomplished automatically on a computer.