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

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2004, Pages 876-879

  Ebendt, Rüdiger ^a   Günther, Wolfgang ^b   Drechsler, Rolf ^a  

^a UNIVERSITY OF BREMEN   (Germany)

^b INFINEON TECHNOLOGIES AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; AUTOMATION; BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS; GRAPH THEORY; MULTIPLEXING; OPTIMIZATION; PROBLEM SOLVING;

BEST-FIRST SEARCH; BINARY DECISION DIAGRAMS (BDD); COMPLEMENT EDGES (CE); LOGIC SYNTHESIS; RUNTIME;

DECISION THEORY;

EID: 2442452478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. B. Bollig and I. Wegener, "Improving the variable ordering of OBDDs is HP-complete," IEEE Trans. on Camp., Vol. 9(45), pp. 993-1002, 1996.
2. K. Brace, R. Rudell, and R.E. Bryant, "Efficient Implementation of a BDD Package", in Design Automation Conf., pp. 40-45, 1990.
3. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. on Comp., Vol. 8(35), pp. 677-691, 1986.
4. R. Dechter and J. Pearl, "Generalized best-first search strategies and the optimality of A*," Journal of the Association for Computing Machinery, Vol. 1(34), pp. 1-38, 1987.
5. R. Drechsler, N. Drechsler, and W. Günther, "Fast exact minimization of BDDs," IEEE Trans. on CAD, Vol. 3(19), pp. 384-389, 2000.
6. R. Ebendt, "Reducing the number of variable movements in exact BDD minimization," in Int'l Symp. on Circuits and Systems, Vol. 5, pp. 605-608, 2003.
7. R. Ebendt, W. Günther, and R. Drechsler, "Combination of lower bounds in exact BDD minimization," in Design, Automation and Test in Europe, pp. 758-763, 2003.
8. S. Friedman and K. Supowit, "Finding the optimal variable ordering for binary decision diagrams," in Design Automation Conf., pp. 348-356, 1987.
9. H. Fujii, G. Ootomo, and C. Hori, "Interleaving based variable ordering methods for ordered binary decision diagrams," in Int'l Conf. on CAD, pp. 38-41, 1993.
10. P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst. Sci. Cybern., Vol. 2. pp. 100-107, 1968.
11. N. Ishiura, H. Sawada, and S. Yajima, "Minimization of binary decision diagrams based on exchange of variables," in Int'l Conf. on CAD, pp. 472-475, 1991.
12. S.-W. Jeong, T.-S. Kim, and F. Somenzi, "An efficient method for optimal BDD ordering computation," in International Conference on VLSI and CAD, 1993.
13. L. Macchiarulo, L. Benini, and E. Macii, "On-the-fly layout generation for PTL macrocells," in Design, Automation and Test in Europe, pp. 546-551, 2001.
14. R. Rudell, "Dynamic variable ordering for ordered binary decision diagrams," in Int'l Conf. on CAD, pp. 42-47, 1993.
15. F. Somenzi, CU Decision Diagram Package Release 2.3.1, University of Colorado at Boulder, 2002.