Computer Design of Multiple-Output Logical Networks
- 1 March 1961
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-10 (1), 21-30
- https://doi.org/10.1109/tec.1961.5219148
Abstract
An important step in the design of digital machines lies in the derivation of the Boolean expressions which describe the combinational logical networks in the system. Emphasis is generally placed upon deriving expressions which are minimal according to some criteria. A computer program has been prepared which automatically derives a set of minimal Boolean expressions describing a given logical network with multiple-output lines. The program accepts punched cards listing the in-out relations for the network, and then prints a list of expressions which are minimal according to a selected one of three criteria. This paper describes the basic design procedure and the criteria for minimality.Keywords
This publication has 7 references indexed in Scilit:
- On Cores and Prime Implicants of Truth FunctionsThe American Mathematical Monthly, 1959
- Automatic design of logical networksPublished by Association for Computing Machinery (ACM) ,1959
- The minimality of rectifier nets with multiple outputs incompletely specifiedJournal of the Franklin Institute, 1957
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952