An efficient program for logic synthesis of mod-2 sum expressions
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Resurrected interest in mod-2 sum logic requires efficient algorithms for synthesis of incompletely specified multiple-output functions. The authors report on a program based on new algorithms: Quasi-minimum covering is obtained in a polarized Reed-Muller domain using a modified disjoint sharp operator. Since a new algorithm for cubewise RMT is applied, and since no iterative procedures are employed, the program performs about an order of magnitude faster than other algorithms. The new program can handle functions of hundreds of variables on a personal computer. Solutions are (on average) superior to those of other methods.Keywords
This publication has 10 references indexed in Scilit:
- 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
- Computation of Reed-Muller expansions of incompletely specified boolean functions from reduced representationsIEE Proceedings E Computers and Digital Techniques, 1991
- On the complexity of mod-2l sum PLA'sIEEE Transactions on Computers, 1990
- A Computer Algorithm for Minimizing Reed-Muller Canonical FormsIEEE Transactions on Computers, 1987
- SPECTRAL PROCESSING OF SWITCHING FUNCTIONS USING SIGNAL–FLOW TRANSFORMATIONSPublished by Elsevier ,1985
- Efficient computer method for ExOR logic designIEE Proceedings E Computers and Digital Techniques, 1983
- A Method for Modulo-2 MinimizationIEEE Transactions on Computers, 1982
- Minimization of Reed–Muller Canonic ExpansionIEEE Transactions on Computers, 1979
- 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