By Topic

Combining ordered best-first search with branch and bound for exact BDD minimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ebendt, R. ; Inst. of Comput. Sci., Univ. of Bremen, Germany ; Gunther, W. ; Drechsler, R.

Reduced-ordered binary decision diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e., the size may vary from linear to exponential, and the problem of improving the variable ordering is known to be NP-complete. In this paper, a new exact BDD minimization algorithm called Astute is presented. Here, ordered best-first search, i.e., the A* algorithm, is combined with a classical branch-and-bound (B&B) algorithm. A* operates on a state space large parts of which are pruned by a best-first strategy expanding only the most promising states. Combining A* with B&B allows to avoid unnecessary computations and to save memory. Experimental results demonstrate the efficiency of our approach.

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:24 ,  Issue: 10 )