An improved branch and bound algorithm for exact BDD minimization

Ordered binary decision diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis and formal verification. The size of the BDDs depends on a chosen variable ordering, i.e., the size may vary from linear to exp...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computer-aided design of integrated circuits and systems Vol. 22; no. 12; pp. 1657 - 1663
Main Authors: Ebendt, R., Gunther, W., Drechsler, R.
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2003
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Binary decision diagrams
Boolean functions
Computer aided design
Computer science
Construction
Costs
Data structures
Design engineering
Formal verification
Logic
Logic synthesis
Lower bounds
Minimization methods
Optimization
Order disorder
Representations
Runtime
Very large scale integration
ISSN:0278-0070, 1937-4151
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ordered binary decision diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis and formal verification. The size of the 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, we present a new exact branch and bound technique for determining an optimal variable order. In contrast to all previous approaches that only considered one lower bound, our method makes use of a combination of three bounds and, by this, avoids unnecessary computations. The lower bounds are derived by generalization of a lower bound known from very large scale integration design. They allow one to build the BDD either top down or bottom up. Experimental results are given to show the efficiency of our approach.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0278-0070
1937-4151
DOI:10.1109/TCAD.2003.819427