Reducing variable dependency in combinational circuits
- 1 November 1964
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The problem of encoding inputs to an n-input, 2-output combinational circuit so as to reduce the number of variables upon which the two output functions depend is considered in this paper. It is assumed that the number of input conditions (n-vectors) which must produce each output state is given. It is clear that for each mapping of n-vectors into output status a different pair of output functions will be specified. The objective of this work is to find that pair of output functions which is independent of as many of the input variables as possible. The problem is first considered for the case where all 2n input conditions are specified. The solution obtained here is later generalized to allow for don't care conditions. The generalization of the problem to m output functions is also discussed.Keywords
This publication has 5 references indexed in Scilit:
- On the State Assignment Problem for Sequential Machines IIIEEE Transactions on Electronic Computers, 1961
- On the State Assignment Problem for Sequential Machines. IIEEE Transactions on Electronic Computers, 1961
- Encoding of incompletely specified Boolean matricesPublished by Association for Computing Machinery (ACM) ,1960
- Simultaneous logical equations: Matrix logic IVTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1960
- Simplification of a Class of Boolean FunctionsJournal of the ACM, 1958