Fast exact minimization of BDD´s

Author

Drechsler, Rolf ; Drechsler, Nicole ; Günther, Wolfgang

Author_Institution

Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany

Volume

19

Issue

3

fYear

2000

fDate

3/1/2000 12:00:00 AM

Firstpage

384

Lastpage

389

Abstract

We present a new exact algorithm for finding the optimal variable ordering for reduced ordered binary decision diagrams (BDD´s). The algorithm makes use of a lower bound technique known from very large scale integration design. Up to now this technique has been used only for theoretical considerations and it is adapted here for this purpose. Furthermore, the algorithm supports symmetry aspects and uses a hashing based data structure. Experimental results are given to demonstrate the efficiency of our approach. We succeeded in minimizing several functions, including adders with up to 64 variables, for which all other previously presented approaches fail

Keywords

Boolean functions; binary decision diagrams; data structures; logic CAD; minimisation; BDD minimisation; adders; binary decision diagrams; exact algorithm; fast exact minimization; hashing based data structure; lower bound technique; optimal variable ordering; reduced ordered BDDs; symmetry aspects; Adders; Algorithm design and analysis; Binary decision diagrams; Boolean functions; Circuit synthesis; Circuit testing; Data structures; Design methodology; Minimization; Very large scale integration;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.833206

Filename

833206