Efficient implementation of a BDD package. Efficient manipulation of Boolean functions is an important component of many computer-aided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementation of the if-then-else (ITE) operator. A hash table is used to maintain a strong canonical form in the ROBDD, and memory use is improved by merging the hash table and the ROBDD into a hybrid data structure. A memory function for the recursive ITE algorithm is implemented using a hash-based cache to decrease memory use. Memory function efficiency is improved by using rules that detect when equivalent functions are computed. The usefulness of the package is enhanced by an automatic and low-cost scheme for recycling memory. Experimental results are given to demonstrate why various implementation trade-offs were made. These results indicate that the package described here is significantly faster and more memory-efficient than other ROBDD implementations described in the literature.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Horiyama, Takashi; Ibaraki, Toshihide: Translation among CNFs, characteristic models and ordered binary decision diagrams (2003)
- Horiyama, Takashi; Ibaraki, Toshihide: Ordered binary decision diagrams as knowledge-bases (2002)
- Wegener, Ingo: Worst case examples for operations on OBDDs (2000)
- Moore, J. Strother: Introduction to the OBDD algorithm for the ATP community (1994)