Sampling schemes for computing OBDD variable orderings

We suggest some novel variable ordering techniques based upon the notion of sampling. Such techniques can produce highly effective static variable orders, and can thus be employed in numerous problems where current static variable ordering techniques prove totally inadequate. They can also augment various reordering techniques thereby helping to produce far superior variable orders in a comparable, or lesser, amount of time. Importantly, we have been able to build BDDs of circuits which could not be represented previously using numerous other reordering packages.

[1]  Christoph Meinel,et al.  Sample Method for Minimization of OBDDs , 1998, SOFSEM.

[2]  Jacob A. Abraham,et al.  Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions , 1997, IEEE Trans. Computers.

[3]  A. Sangiovanni-Vincentelli,et al.  Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions , 1996, ICCAD 1996.

[4]  João Silva.  Search algorithms for satisfiability problems in combinational switching circuits , 1996 .

[5]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[6]  A. Sangiovanni-Vincentelli,et al.  Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functions , 1996, Proceedings of International Conference on Computer Aided Design.

[7]  Rolf Drechsler,et al.  A genetic algorithm for variable ordering of obdds , 1996 .

[8]  F. Somenzi,et al.  Who are the variables in your neighbourhood , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[9]  Don E. Ross,et al.  Efficient variable ordering and partial representation algorithm , 1995, Proceedings of the 8th International Conference on VLSI Design.

[10]  J. A. Abraham,et al.  Eecient Variable Ordering and Partial Representation Algorithms , 1995 .

[11]  Fabio Somenzi,et al.  Who are the variables in your neighborhood , 1995, ICCAD.

[12]  Fabio Somenzi,et al.  Symmetry Detection And Dynamic Variable , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[13]  Fabio Somenzi,et al.  Symmetry detection and dynamic variable ordering of decision diagrams , 1994, ICCAD '94.

[14]  Rolf Drechsler,et al.  Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams , 1994, 31st Design Automation Conference.

[15]  C. Meinel,et al.  Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.

[16]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[17]  Hiroshige Fujii,et al.  Interleaving based variable ordering methods for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[18]  Janak H. Patel,et al.  Efficient variable ordering heuristics for shared ROBDD , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[19]  Jacob A. Abraham,et al.  Probabilistic verification of Boolean functions , 1992, Formal Methods Syst. Des..

[20]  Don E. Ross,et al.  Functional approaches to generating orderings for efficient symbolic representations , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[21]  Hiroshi Sawada,et al.  Minimization of binary decision diagrams based on exchanges of variables , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[22]  Srinivas Devadas,et al.  Boolean satisfiability and equivalence checking using general binary decision diagrams , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[23]  Masahiro Fujita,et al.  On variable ordering of binary decision diagrams for the application of multi-level logic synthesis , 1991, Proceedings of the European Conference on Design Automation..

[24]  Robert K. Brayton,et al.  Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[25]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[26]  Albert R. Wang,et al.  Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[27]  藤田 昌宏,et al.  Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams , 1988 .

[28]  Kenneth J. Supowit,et al.  Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1987, 24th ACM/IEEE Design Automation Conference.

[29]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[30]  J. Kelly.  Arrow Impossibility Theorems , 1978 .