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

[1]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2]  K. Karplus.  Using if-then-else DAGs for multi-level logic minimization , 1989 .

[3]  Masahiro Fujita,et al.  Multi-level logic optimization using binary decision diagrams , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[5]  Albert R. Wang,et al.  Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[6]  Kenneth J. Supowit,et al.  Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1987, 24th ACM/IEEE Design Automation Conference.