Efficient implementation of a BDD package-英文文献.pdf

Efficient Implementation of a BDD Pack.age Karl S. Brace’ Richard L. Rudell Randal E. Bryant* Dept of ECE Syinopsys, Inc. School of Computer Science Carnegie Mellon 1098 Alta Avenue Carnegie Mellon Pittsburgh, PA 15213 Mountain View, CA 94043 Pittsburgh, PA 152 13 Abstract in CAD have an exponential size in the sum-of-:products represen- tation [9], and checking tautology in a general Boolean network Efficient manipulation of Boolean functions is an important compo- appears to be intractable [lo], making these representations unac- nent of many computer-aided design tasks. This paper describes a ceptable for a general package. package for manipulating Boolean functions based on the reduced, The representation we have found most useful for manipulating ordered, binary decision diagram (ROBDD) representation. The Boolean functions is the reduced, ordered, binary-decision diagram package is based on an efficient implementation of the if-then-else (ROBDD) [Il. 12. 131. The ROBDD is a canorlical fOm, so the (ITE) operator. A hash table is used to maintain a strong carwni- tautology test is