Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Computation of Reed-Muller expansions of incompletely specified boolean functions from reduced representationsIEE Proceedings E Computers and Digital Techniques, 1991
- An efficient program for logic synthesis of mod-2 sum expressionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- On the complexity of mod-2l sum PLA'sIEEE Transactions on Computers, 1990
- Universal Test Sets for Multiple Fault Detection in AND-EXOR ArraysIEEE Transactions on Computers, 1978
- Unateness Properties of and-Exclusive-or Logic CircuitsIEEE Transactions on Computers, 1974
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- 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