Integration, the VLSI Journal
Efficient Minimization and Manipulation of Linearly Transformed Binary Decision Diagrams
IEEE Transactions on Computers
Minimization of the expected path length in BDDs based on local changes
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Combining ordered best-first search with branch and bound for exact BDD minimization
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Combination of Lower Bounds in Exact BDD Minimization
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Average Path Length of Binary Decision Diagrams
IEEE Transactions on Computers
Lower bounds for dynamic BDD reordering
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
A Totally Self-Checking S-box Architecture for the Advanced Encryption Standard
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
An efficient estimation of the ROBDD's complexity
Integration, the VLSI Journal
FSM Encoding for BDD Representations
International Journal of Applied Mathematics and Computer Science
BDD-Based Synthesis of Reversible Logic
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.04 |
We present a new exact algorithm for finding the optimal variable ordering for reduced ordered binary decision diagrams (BDD's). The algorithm makes use of a lower bound technique known from very large scale integration design. Up to now this technique has been used only for theoretical considerations and it is adapted here for this purpose. Furthermore, the algorithm supports symmetry aspects and uses a hashing based data structure. Experimental results are given to demonstrate the efficiency of our approach. We succeeded in minimizing several functions, including adders with up to 64 variables, for which all other previously presented approaches fail