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!

Be the first to leave a comment!