On the effect of local changes in the variable ordering of ordered decision diagrams

Information Processing Letters

Volumn 59, Issue 5, 1996, Pages 233-239

  Bollig, Beate ^a   Löbbing, Martin ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Algorithms; Computational complexity; Variable ordering

Indexed keywords

EID: 13544249131     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00119-6     Document Type: Article

References (17)

1. B. Becker, R. Drechsler and R. Werchner, On the relations between BDDs and FDDs, in: Proc. LATIN '95, Lecture Notes on Computer Science 911 (Springer, Berlin, 1995) 72-83.
2. B. Bollig, M. Löbbing, M. Sauerhoff and I. Wegener, Complexity theoretical aspects of OFDDs, in: Proc. Workshop on Applications of the Reed-Muller Expansion in Circuit Design (1995) 198-205.
3. B. Bollig, M. Löbbing and I. Wegener, Simulated annealing to improve variable orderings for OBDDs, in: Internat. Workshop on Logic Synthesis IWLS '95 (1995) 5-1-5-10.
4. B. Bollig and I. Wegener, Improving the variable ordering for OBDDs is NP-complete. IEEE Trans. Comput., to appear.
5. F. Brglez and H. Fujiwara, A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN, in: Proc. IEEE Internat. Symp. on Circuits and Systems (ISCAS) (1985).
6. R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. Comput. 35 (1986) 677-691.
7. R.E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comput. Surveys bf24 (1992) 293-318.
8. M. Fujita, Y. Matsunaga and T. Kakuda, On variable ordering of binary decision diagrams for the application of multilevel logic synthesis, in: Proc. European Design Automation Conf. (1991) 50-54.
9. N. Ishiura, H. Sawada and S. Yajima, Minimization of binary decision diagrams based on exchanges of variables, in: Proc. IEEE Internat. Conf. on Computer Aided Design (1991) 472-475.
10. U. Kebschull and W. Rosenstiel, Efficient graph-based computation and manipulation of functional decision diagrams, in: Proc. European Design Automation Conf. (1993) 278-282.
11. U. Kebschull, E. Schubert and W. Rosenstiel, Multilevel logic synthesis based on functional decision diagrams in: Proc. European Design Automation Conf. (1992) 43-47.
12. P.J.M. van Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Applications (Kluwer Academic Publishers, Dordrecht, 1987).
13. M.R. Mercer, R. Kapur and D.E. Ross, Functional approaches to generating orderings for efficient symbolic representation, in: Proc. 29. ACM/IEEE Design Automation Conf. (1992) 624-627.
14. S. Panda and F. Somenzi, Who are the variables in your neighborhood, in: Proc. Internat. Workshop on Logic Synthesis IWLS '95 (1995) 5-11-5-20.
15. R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, Proc. IEEE Internat. Conf. on Computer Aided Design (1993) 42-47.
16. D. Sieling and I. Wegener, NC-algorithms for operations on binary decision diagrams, Parallel Process. Lett. 3 (1993) 3-12.
17. K.H. Wang, T.T. Hwang and C. Chen, Restructuring binary decision diagrams based on functional equivalence, in: Proc. European Design Automation Conf. (1993) 261-265.