Algorithm for Minimal Polarized Polynomial Form Determination
- 1 December 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (12) , 1313-1315
- https://doi.org/10.1109/T-C.1974.223854
Abstract
Boolean difference when considering the polarized polynomial forms (AND–EXCLUSIVE OR forms in which each variable in all terms is complemented or uncomplemented) is used in this correspondence. Algorithms for determining quasi-minimnal and minimal polarized forms of the given functions are described.Keywords
This publication has 7 references indexed in Scilit:
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- Minimization of Exclusive or and Logical Equivalence Switching CircuitsIEEE Transactions on Computers, 1970
- On Minimal Modulo 2 Sums of Products for Switching FunctionsIEEE Transactions on Electronic Computers, 1967
- Procedures for minimization of "Exclusive-or" and "Logical-equivalence" switching circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965
- On a Theory of Boolean FunctionsJournal of the Society for Industrial and Applied Mathematics, 1959
- A class of multiple-error-correcting codes and the decoding schemeTransactions of the IRE Professional Group on Information Theory, 1954
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954