Minimization of Boolean Functions*

作者: E. J. McCluskey

DOI: 10.1002/J.1538-7305.1956.TB03835.X

关键词:

摘要: … A systematic procedure is presented for writing a Boolean function as a minimum sum of products. … Specific attention is given to terms which can be included in the function solely for the …

参考文章(5)
M. Karnaugh, The map method for synthesis of combinational logic circuits Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics. ,vol. 72, pp. 593- 599 ,(1953) , 10.1109/TCE.1953.6371932
Claude E. Shannon, A symbolic analysis of relay and switching circuits Transactions of The American Institute of Electrical Engineers. ,vol. 57, pp. 713- 723 ,(1938) , 10.1109/T-AIEE.1938.5057767
Claude. E. Shannon, The synthesis of two-terminal switching circuits Bell System Technical Journal. ,vol. 28, pp. 59- 98 ,(1949) , 10.1002/J.1538-7305.1949.TB03624.X
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, The Problem of Simplifying Truth Functions American Mathematical Monthly. ,vol. 59, pp. 521- 531 ,(1952) , 10.1080/00029890.1952.11988183