ACM Home Page
Please provide us with feedback. Feedback
Efficient implementation of a BDD package
Full text PdfPdf (786 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 27th ACM/IEEE conference on Design automation table of contents
Orlando, Florida, United States
Pages: 40 - 45  
Year of Publication: 1991
ISBN:0-89791-363-9
Authors
Karl S. Brace  Dept of ECE, Carnegie Mellon, Pittsburgh, PA
Richard L. Rudell  Synopsys, Inc., 1098 Alta Avenue, Mountain View, CA
Randal E. Bryant  School of Computer Science, Carnegie Mellon, Pittsburgh, PA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 41,   Downloads (12 Months): 198,   Citation Count: 175
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/123186.123222
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Malik, A, Wang, R. Braytori, and A, Sangiovanni- Vincentelli, "Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment," in Proc. Int. Conf. CAD (ICCAD-88), Nov. 1988, pp. 6-9.
 
2
M. Fujita, H. Fujisawa, and N. Kawato, "Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams," in Proc. Int. Conf. CAD (ICCAD- 88), Nov. 1988, pp. 2-5.
 
3
O. Coudert, C. Berthet, andJ. Madre, "Verification of Sequential Machines using Boolean Function Vectors," in IMEC-IFIP ira. Workshop on Applied Formal Methods for Correct VLS! Design, 1989.
 
4
 
5
M. A. Breuer and A. D. Friedman, Diagnosis and Reliable Design of Digitial Systems. Computer Science Press, 1976.
6
 
7
K. Cho, Test Pattern Generation for Combinational and Sequential MOS Circuits by Symbolic Fault Siamlation. PhD thesis, Carnegie Mellon University, 1988.
 
8
M.R. Garey and D. S. Johnson, Computers and Inlractability. W. H. Freeman and Company, 1979.
 
9
 
10
D. Bostick, G. D. Hachtcl, R. Jacoby, M. R, Lighmcr, E Moceyunas, C. R. Morrison, and D. Rav enscroft, "The Boulder Optimal Logic Design System," in Proc. Ira. Conf. CAD (ICCAD-87), Nov. 1987, pp. 62-65.
 
11
C. Y. Lee, "Representation of Switching Circuits by Binary- Decision Programs," Bell System Technical Journal, col. 38, pp. 985-999, July 1959.
 
12
 
13
 
14
D.S. Reeves and M. J. irwin, "Fast Methods for Switch-Level Verification of MOS Circuits," ~ Trans. Elec. Comp., col. CAD-6, pp. 766-779, Sep. 1987.
 
15
 
16
S. B. Akers, "Functional Testing with Binary Decision Diagrams," in Eighth Annual Conference on Fault-Tolerant Computing, 1978, pp. 75-82.
 
17
 
18
R. Lisanke, "Logic Synthesis Benchmarks," in Proc. Int. Workshop on Logic Synthesis (}WLS-89), May 1989.
 
19

CITED BY  175