Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference
DOI: 10.1109/aspdac.1997.600304
|View full text |Cite
|
Sign up to set email alerts
|

On the representational power of bit-level and word-level decision diagrams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 15 publications
0
7
0
Order By: Relevance
“…Using *BMDs it was for the first time possible to verify multipliers of bit length up to n=256, however, they fail for the representation of Boolean functions that can easily be represented using BDDs. A thorough review of different Decision Diagrams can be found in [14]. They still suffer from memory explosion when dealing with wide arithmetic operations due to defining functions over binary variables as a bit vector rather than integer variables.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Using *BMDs it was for the first time possible to verify multipliers of bit length up to n=256, however, they fail for the representation of Boolean functions that can easily be represented using BDDs. A thorough review of different Decision Diagrams can be found in [14]. They still suffer from memory explosion when dealing with wide arithmetic operations due to defining functions over binary variables as a bit vector rather than integer variables.…”
Section: Related Workmentioning
confidence: 99%
“…then the leading term is reduced to LC*(LM-(lines[13][14]. If, however, ∀i=1,…,d: k i < µ i , then the reduction is performed based onLemma 1 and Theorem 2.…”
mentioning
confidence: 99%
“…In a first series of experiments we compare K*BMDs to other data structures, like EVBDDs [25], OFDDs [23] and *BMDs [10,11], on some of the clique functions for graphs from [20,4,3]:…”
Section: Variable Ordering and Decomposition Type Choicementioning
confidence: 99%
“…It is known from [2]: The OFDD for a Boolean function represented by a *BMD can be obtained by performing a modulo 2 operation in each node and reducing the resulting graph.…”
Section: Preliminariesmentioning
confidence: 99%