Improving BDDs manipulation through incremental reduction and enhanced heuristics

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 lite...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the IEEE 1991 Custom Integrated Circuits Conference pp. 11.3/1 - 11.3/5
Main Authors Calazans, N., Jacobi, R., Zhang, Q., Trullemans, C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1991
Subjects
Application software
Application specific integrated circuits
Binary decision diagrams
Boolean functions
Data structures
Jacobian matrices
Logic
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780780300156
0780300157
DOI:10.1109/CICC.1991.164034