A new scheme to compute variable orders for binary decision diagrams
Jawahar Jain, James R. Bitner, Dinos Moundanos et al. · 2002
Introduces some new methods for estimating the "importance" of a variable in a Boolean function, and uses them to compute variable orders for OBDD construction. These measures are based on information theoretic criteria, and require the computation of the entropy of a variable in a given function. These entropy measures prove quite effective in distinguishing the importance of variables. Experimental results show this to be a very encouraging approach to help in the solution of this well known problem.>
Cited by 7 works. doi:10.1109/glsv.1994.289986
Authors
References
- Graph-Based Algorithms for Boolean Function Manipulation
- Logic verification using binary decision diagrams in a logic synthesis environment
- Decision Trees and Diagrams
- Evaluation and improvement of Boolean comparison method based on binary decision diagrams
- Dynamic variable ordering for ordered binary decision diagrams
- Dynamic variable ordering for ordered binary decision diagrams
- Minimization of binary decision diagrams based on exchanges of variables
- On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
- On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
- Functional approaches to generating orderings for efficient symbolic representations