Improving BDDs manipulation through incremental reduction and enhanced heuristics
Calazans, N.;Jacobi, R.;Zhang, Q.;Trullemans, Charles
(1991) Proceedings of the IEEE 1991 Custom Integrated Circuits Conference (Cat. No.91CH2994-2) — Location: San Diego, CA, USA (12.May.1991)
Files
No attached file found for this publication.
Details
Authors
Calazans, N.
Author
Jacobi, R.
Author
Zhang, Q.
Author
Trullemans, CharlesUCLouvain
Author
Abstract
The authors present techniques leading to small binary decision diagrams (BDDs) for combinational functions. They propose some new heuristics for computing an initial variable ordering, one of which is shown to represent a significant enhancement over the best ones the authors could find in the literature. Additionally, they introduce a novel incremental method, devised to quickly change the variable ordering intrinsic to these diagrams. They discuss an application of this method involving the reduction of the size of diagrams after their construction. Comparison with previously published results is provided.
Calazans, N., Jacobi, R., Zhang, Q., & Trullemans, C. (1991). Improving BDDs manipulation through incremental reduction and enhanced heuristics. Proceedings of the IEEE 1991 Custom Integrated Circuits Conference(Cat. No.91CH2994-2), p. 11.3/1-11.3/5. https://doi.org/10.1109/CICC.1991.164034