Minimization of Exclusive or and Logical Equivalence Switching Circuits
- 1 February 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (2), 132-140
- https://doi.org/10.1109/t-c.1970.222878
Abstract
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In particular, algorithms are presented for obtaining minimal modulo 2 or complement modulo 2 sum-of- products (or sums) expressions of any arbitrary single-output or multiple-output switching function with fixed polarities of the input variables.Keywords
This publication has 10 references indexed in Scilit:
- Unate Cellular LogicIEEE Transactions on Computers, 1969
- On Minimal Modulo 2 Sums of Products for Switching FunctionsIEEE Transactions on Electronic Computers, 1967
- A Survey of Microcellular ResearchJournal of the ACM, 1967
- Revised Matrix Algorithms for Shortest PathsSIAM Journal on Applied Mathematics, 1967
- Cutpoint Cellular LogicIEEE Transactions on Electronic Computers, 1964
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962
- A programming languagePublished by Association for Computing Machinery (ACM) ,1962
- A Procedure for Clique Detection Using the Group MatrixSociometry, 1957
- 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