Abstract
A decomposition approach of the combinational functions is discussed. A design method, by which the minimization or near minimization of two-level combinational network can be obtained, is presented for a combinational function realized by using multiplexer universal logic modules. Using the method, the automated synthesis of the combinational functions can be accomplished on a computer.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Voith R. P. ULM implicants for minimization of universal logic module circuits. IEEE Trans Comput, 1977, C-26(5): 417–412.
Cheung C C, Ehrich R W. On the minimization of tree-type universal logic circuits. IEEE Trans Comput, 1975, C-24(11): 1110–1113.
Pal A. An algorithm for optimal logic design using multiplexers. IEEE Trans Comput, 1986, C-35(8): 755–757.
Fang K Y, Wojcik A S. Modular decomposition of combinational multiple-valued circuits. IEEE Trans Comput, 1988, C-37(10): 1293–1301.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jiang, W. A method for minimization design of two-level logic networks using multiplexer universal logic modules. J. of Compt. Sci. & Technol. 9, 92–96 (1994). https://doi.org/10.1007/BF02939490
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02939490