DocumentCode
2891038
Title
Extended BDD´s: trading off canonicity for structure in verification algorithms
Author
Jeong, S.-W. ; Plessier, B. ; Hachtel, G. ; Somenzi, F.
Author_Institution
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
fYear
1991
fDate
11-14 Nov. 1991
Firstpage
464
Lastpage
467
Abstract
The authors present an extension to binary decision diagrams (BDDs) that exploits the information contained in the structure of the circuit to produce a compact, semicanonical representation. The extended BDDs (XBDDs) retain many of the advantages of BDDs while at the same time allowing one to deal with larger circuits. Using XBDDs, it is possible to verify circuits for which the BDDs could not be built in the same amount of space. Results of the application of XBDDs to combinational multipliers are presented.<>
Keywords
combinatorial circuits; data structures; logic testing; multiplying circuits; binary decision diagrams; combinational multipliers; logic circuits verification; semicanonical representation; Binary decision diagrams; Boolean functions; Circuit synthesis; Combinational circuits; Data structures; Design automation; Formal verification; Logic circuits; Reluctance generators; Size control;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1991. ICCAD-91. Digest of Technical Papers., 1991 IEEE International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-2157-5
Type
conf
DOI
10.1109/ICCAD.1991.185305
Filename
185305
Link To Document