Design of experiments in BDD variable ordering: lessons learned

Applying the design of experiments methodology to the evaluation of BDD variable ordering algorithms has yielded a number of conclusive results. The methodology relies on the equivalence classes of functionally perturbed circuits that maintain logic invariance, or are within (1, 2, ...)-minterms of the original reference circuit function, also maintaining entropy-invariance. For some of the current variable ordering algorithms and tools, the negative results include: statistically significant sensitivity to naming of variables; confirmation that a number of variable ordering algorithms are statistically equivalent to a random variable order assignment; and observation of a statistically anomalous variable ordering behavior of a well known benchmark circuit isomorphic class when analyzed under single and multiple outputs. On the positive side, the methodology supports a statistically significant merit evaluation of any newly introduced variable ordering algorithm, including the one briefly introduced in this paper.

[1]  Franc Brglez,et al.  A framework and method for hierarchical test generation , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[2]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

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

[4]  R. Rudell Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD 1993.

[5]  Pranav Ashar,et al.  Efficient Breadth-first Manipulation Of Binary Decision Diagrams , 1994, IEEE/ACM International Conference on Computer-Aided Design.

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

[7]  Franc Brglez,et al.  Detectable perturbations: a paradigm for technology-specific multi-fault test generation , 1995, Proceedings 13th IEEE VLSI Test Symposium.

[8]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[9]  Nevin Kapur,et al.  Towards a new benchmarking paradigm in EDA: analysis of equivalence class mutant circuit distributions , 1997, ISPD '97.

[10]  Design of Experiments to Evaluate CAD Algorithms: Which Improvements Are Due to Improved Heuristic and Which Are Merely Due to Chance? , 1998 .

[11]  Nevin Kapur,et al.  Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking , 1998, Proceedings Design, Automation and Test in Europe.

[12]  Franc Brglez,et al.  Design of Experiments for Evaluation of BDD Packages Using Controlled Circuit Mutations , 1998, FMCAD.

[13]  Baldomir Zajc Multi-level Logic Optimization Based on Wave Synthesis of Permissible Mutation Functions (WASP) , 1998 .