Computer Design of Multiple-Output Logical Networks

作者: Thomas C. Bartee

DOI: 10.1109/TEC.1961.5219148

关键词:

摘要: An important step in the design of digital machines lies derivation Boolean expressions which describe combinational logical networks system. Emphasis is generally placed upon deriving are minimal according to some criteria. A computer program has been prepared automatically derives a set describing given network with multiple-output lines. The accepts punched cards listing in-out relations for network, and then prints list selected one three This paper describes basic procedure criteria minimality.

参考文章(7)
D. E. Muller, Application of Boolean algebra to switching circuit design and to error detection Transactions of the I.R.E. Professional Group on Electronic Computers. ,vol. 3, pp. 6- 12 ,(1954) , 10.1109/IREPGELC.1954.6499441
E. J. McCluskey, Minimization of Boolean Functions* Bell System Technical Journal. ,vol. 35, pp. 1417- 1444 ,(1956) , 10.1002/J.1538-7305.1956.TB03835.X
Robert McNaughton, Bernon Mitchell, The minimality of rectifier nets with multiple outputs incompletely specified Journal of the Franklin Institute. ,vol. 264, pp. 457- 480 ,(1957) , 10.1016/0016-0032(57)90106-0
T. C. Bartee, Automatic design of logical networks Papers presented at the the March 3-5, 1959, western joint computer conference on XX - IRE-AIEE-ACM '59 (Western). pp. 103- 107 ,(1959) , 10.1145/1457838.1457856
W. V. Quine, A Way to Simplify Truth Functions American Mathematical Monthly. ,vol. 62, pp. 627- 631 ,(1955) , 10.1080/00029890.1955.11988710
Willard Van Orman Quine, On Cores and Prime Implicants of Truth Functions American Mathematical Monthly. ,vol. 66, pp. 755- 760 ,(1959) , 10.1080/00029890.1959.11989404
Willard Van Orman Quine, The Problem of Simplifying Truth Functions American Mathematical Monthly. ,vol. 59, pp. 521- 531 ,(1952) , 10.1080/00029890.1952.11988183