Title :
Heuristic Minimization of BDDs Using Don´t Cares
Author :
Shiple, Thomas R. ; Hojati, Ramin ; Sangiovanni-Vincentelli, Alberto L. ; Brayton, Robert K.
Author_Institution :
Department of EECS, University of California, Berkeley, CA
Abstract :
We present heuristic algorithms for finding a minimum BDD size cover of an incompletely specified function, assuming the variable ordering is fixed. In some algorithms based on BDDs, incompletely specified functions arise forwhich any cover of the functionwill suffice. Choosing a cover that has a small BDD representation may yield significant performance gains. We present a systematic study of this problem, establishing a unified framework for heuristic algorithms, proving optimality in some cases,and presenting experimental results.
Keywords :
Automata; Binary decision diagrams; Boolean functions; Circuits; Concrete; Data structures; Decision trees; Field programmable gate arrays; State-space methods;
Conference_Titel :
Design Automation, 1994. 31st Conference on
Print_ISBN :
0-89791-653-0
DOI :
10.1109/DAC.1994.204103
