论文信息 - The synthesis of TANT networks

The synthesis of TANT networks

This paper presents an algorithm for finding, for any given Boolean function, a least cost three-level AND-NOT network having uncomplemented inputs where the cost criterion is the number of gates. The approach taken is similar to the Quine-MeCluskey algorithm for two level AND/OR network synthesis.

James F. Gimpel

[1] Midhat J. Ghazala. Irredundant Disjunctive and Conjunctive Forms of a Boolean Function , 1957, IBM J. Res. Dev..

[2] Leo Hellerman,et al. A Catalog of Three-Variable Or-Invert and And-Invert Logical Circuits , 1963, IEEE Trans. Electron. Comput..

[3] Gerald A. Maley,et al. The Logic Design of Transistor Digital Computers , 1967 .

[4] Fabrizio Luccio,et al. A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..

[5] Willard Van Orman Quine,et al. The Problem of Simplifying Truth Functions , 1952 .

[6] James F. Gimpel. A reduction technique for prime implicant tables , 1964, SWCT.

[7] I. M. Mackintosh,et al. Programmed interconnections—A release from tyranny , 1964 .

[8] E. McCluskey. Minimization of Boolean functions , 1956 .

[9] Edward J. McCluskey,et al. Logical design theory of NOR gate networks with no complemented inputs , 1963, SWCT.