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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computer-aided design of integrated circuits and systems Ročník 22; číslo 12; s. 1657 - 1663
Hlavní autori:	Ebendt, R., Gunther, W., Drechsler, R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2003 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!