Efficient solution of systems of Boolean equations

Authors:
Scott Woods;Giorgio Casinovi
Affiliations:
School of Electrical & Computer Engineering, Georgia Institute of Technology, Atlanta, GA;Info Tech & Telecommunications Lab, Georgia Tech Research Institute, Atlanta, GA
Venue:
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 3
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Gate-level simulation of digital circuits using multi-valued Boolean algebras

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design

Solution of systems of Boolean equations via the integer domain

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation of Boolean functions represented by BDD's can be performed in a very efficient manner. Thus, the algorithm tries to eliminate as many variables and equations as possible through function composition. When the system can no longer be reduced in this way, the elimination process is continued through the use of Shannon decomposition. Numerical results show that the performance of this algorithm is significantly superior to that of a previous algorithm proposed by the authors.