The McBoole Logic Minimizer
- 1 January 1985
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 667-673
- https://doi.org/10.1109/dac.1985.1586014
Abstract
A new logic minimization algorithm is presented. It finds a minimal cover for a multiple-output boolean function expressed as a list of cubes. A directed graph is used to speed up the selection of a minimal cover. Covering cycles are partitioned and branched independently to reduce greatly the branching depth. The resulting minimized list of cubes is guaranteed to be minimal in the sense that no cover with less cubes can exist. The dont care at output is handled properly. This algorithm was implemented in C under UNIX BSD4.2. An extensive comparison with ESPRESSO IIC shows that the new algorithm is particularly attractive for functions with less than 20 input and 20 output variables.Keywords
This publication has 15 references indexed in Scilit:
- Input Variable Assignment and Output Phase Optimization of PLA'sIEEE Transactions on Computers, 1984
- A VLSI FSM Design SystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- A New Technique for the Fast Minimization of Switching FunctionsIEEE Transactions on Computers, 1977
- Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering ProblemIEEE Transactions on Computers, 1975
- The Concept of Term Exclusiveness and Its Effect on the Theory of Boolean FunctionsJournal of the ACM, 1975
- Recursive Operators for Prime Implicant and Irredundant Normal Form DeterminationIEEE Transactions on Computers, 1970
- Generalization of Consensus Theory and Application to the Minimization of Boolean FunctionsIEEE Transactions on Electronic Computers, 1967
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955