Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs
- 1 March 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (3) , 356-359
- https://doi.org/10.1109/tc.1987.1676907
Abstract
Detecting essential primes is important in multiple-valued logic minimization. In this correspondence, we present a fast algorithm that can generate all essential primes without generating a prime cover of the Boolean function. A new consensus operation called asymmetric consensus (acons) is defined. In terms of acons, we prove a necessary and sufficient condition for detecting essential primes for a Boolean function with multiple-valued inputs. The detection of essential primes can be performed by using a tautology checking algorithm. We exploit the unateness of a Boolean function to speed up tautology checking. The notion of unateness considered is more general than that has appeared in the literature.Keywords
This publication has 5 references indexed in Scilit:
- Input Variable Assignment and Output Phase Optimization of PLA'sIEEE Transactions on Computers, 1984
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic ArraysIEEE Transactions on Computers, 1981
- An Introduction to Array LogicIBM Journal of Research and Development, 1975
- MINI: A Heuristic Approach for Logic MinimizationIBM Journal of Research and Development, 1974