Fast minimization of mixed-polarity AND/XOR canonical networks
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Canonical restricted mixed-polarity exclusive sums of productsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Module generation for AND/XOR-fields (XPLAs)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- EXMIN: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued input two-valued output functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An improved algorithm for the minimization of mixed polarity Reed-Muller representationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Testable design of RMC networks with universal tests for detecting stuck-at and bridging faultsIEE Proceedings E Computers and Digital Techniques, 1985
- Universal Test Sets for Multiple Fault Detection in AND-EXOR ArraysIEEE Transactions on Computers, 1978
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972