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

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 pr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on computer-aided design of integrated circuits and systems 2005-10, Vol.24 (10), p.1515-1529
Hauptverfasser:	Ebendt, R., Gunther, W., Drechsler, R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Artificial intelligence best-first search binary decision diagram (BDD) Binary decision diagrams Boolean functions branch and bound (B&B) Costs Data structures Hardware Logic design logic synthesis Minimization methods NP-complete problem pass transistor logic State-space methods
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!