An iterative algorithm for the binate covering problem
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 208-211
- https://doi.org/10.1109/edac.1990.136646
Abstract
Many problems of interest in the field of electronic design automation can be formulated as binate covering problems. This occurs whenever the solution sought for is the minimum cost assignment satisfying a Boolean formula in conjunctive form. Practical problems may have hundreds of variables and thousands of clauses; hence efficient techniques are important. The paper proposes a new iterative scheme that is based on solving a sequence of sub-problems that normally lead to the solution of the original problem in a fraction of the time.Keywords
This publication has 7 references indexed in Scilit:
- OPAM: an efficient output phase assignment for multilevel logic minimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An exact minimizer for Boolean relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Exact algorithms for output encoding, state assignment and four-level Boolean minimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiple-Valued Minimization for PLA OptimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- A New Rule for Reducing CC TablesIEEE Transactions on Computers, 1970
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential NetworksIEEE Transactions on Electronic Computers, 1965
- Minimization of Boolean Functions*Bell System Technical Journal, 1956