Results 41 to 50 of about 3,866,349 (62)

Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences

, 1995
The Ordered Binary-Decision Diagram (OBDD) has been used to reduce the amount of space and computation required for verifying digital circuits by removing redundant copies of subfunctions.
Mike Starkey, Randy Bryant, Y Bryant
core  

Binary Decision Diagrams and the Multiple Variable Order Problem

, 1998
Ordered Binary Decision Diagrams (OBDDs) are the first choice in manipulating and representing Boolean functions in CAD. Since the size of an OBDD heavily depends on the chosen variable order, much effort is spent in finding good and improving existing ...
Stangier C., CABODI, Gianpiero, QUER, Stefano, Slobodova A., Meinel C., Sack H.   +5 more
core  

The I/O-complexity of ordered binary-decision diagram manipulation

, 1995
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems
Lars Arge
core  

Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits

, 1998
Many problems in computer-aided design of highly integrated circuits (CAD for VLSI) can be transformed to the task of manipulating objects over finite domains. The efficiency of these operations depends substantially on the chosen data structures. In the
Thorsten Theobald, Christoph Meinel
core  

SDDs Are Exponentially More Succinct than OBDDs

, 2016
Introduced by Darwiche (2011), sentential decision diagrams (SDDs) are essentially as tractable as ordered binary decision diagrams (OBDDs), but tend to be more succinct in practice.
Bova, Simone Maria
core  

Binary Decision Diagrams and the Multiple Variable Order Problem

Ordered Binary Decision Diagrams (OBDDs) are the first choice in manipulating and representing Boolean functions in CAD. Since the size of an OBDD heavily depends on the chosen variable order, much effort is spent in finding good and improving existing ...
Gianpiero Cabodi, Harald Sack, Anna Slobodová, Christoph Meinel, Christian Stangier, Stefano Quer   +5 more
core  

OBDDs — Ordered Binary Decision Diagrams

1998
In this chapter, we introduce the representation type of ordered binary decision diagrams, called OBDDs for short. Although the underlying model of decision diagrams (or synonymously branching programs) was already studied by Lee and Akers in the 1950s and 1970s, these representations have not been used in serious applications for a long time. In 1986,
Thorsten Theobald
exaly   +2 more sources

3. Ordered Binary Decision Diagrams (OBDDs)

Discrete Mathematics and Applications, 2000
Ingo Wegener
exaly   +2 more sources

Ordered binary decision diagrams and the Shannon effect [PDF]

Discrete Applied Mathematics, 2004
We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. It was known that for most values of n, the expected OBDD size of a random Boolean function with n variables is equal to the worst-case size ...
Hans Jürgen Promel, Anand Srivastav
exaly   +2 more sources

Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams

Formal Methods in System Design, 1996
We present a data structure for Boolean manipulation-the Mod-2-OBDDs-that considerably extends ESOPs (EXOR-sum-of-products) as well as OBDDs (ordered binary decision diagrams). There are Boolean functions of practical interest which have exponential size optimal ESOPs (even multilevel EXOR-expressions) and/or OBDDs that can be represented by (low ...
Gergov, J., Meinel, C.
exaly   +3 more sources