Results 181 to 190 of about 61,529 (217)

Timed binary decision diagrams

Proceedings International Conference on Computer Design VLSI in Computers and Processors, 1997
The paper presents an extension to OBDDs with timing information, called timed binary decision diagrams (TBDDs). TBDDs are also canonical and allow the symbolic manipulation of Boolean functions with timing information. A TBDD software package is implemented based on the existing CMU BDD package.
Zhongcheng Li, Yuhong Zhao, Yinghua Min, Robert K. Brayton   +3 more
openaire   +1 more source

Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams

1996
Functions that map vectors with binary values into the integers are important for the design and verification of arithmetic circuits. We demonstrate how multi-terminal binary decision diagrams (MTBDDs) can be used to represent such functions concisely.
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao   +2 more
openaire   +1 more source

Complex spectral decision diagrams

Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96), 2002
Different decision diagrams for representations of binary and multiple-valued functions in the form of Complex Hadamard Transforms and Spectra are introduced in this paper. Since Complex Hadamard Transform matrix can be recursively expanded through Kronecker products, complex hybrid decision diagrams can be easily derived.
Bogdan J. Falkowski, Susanto Rahardja
openaire   +1 more source

A characterization of binary decision diagrams

IEEE Transactions on Computers, 1993
Binary decision diagrams (BDDs) are a representation of Boolean functions. Its use in the synthesis, simulation, and testing of Boolean circuits has been proposed by various researchers. In all these applications of BDDs solutions to some fundamental computational problems are needed.
openaire   +1 more source

A Heterogeneous Decision Diagram Package

2009
This paper describes a decision diagram package for efficient computation with large matrices. The heterogeneous decision diagrams supported by the package do not require the selection variables to have a single domain. Computations can be over a selected field up to the complex numbers including finite fields. Implementation strategies supporting this
D. Michael Miller, Radomir S. Stankovic
openaire   +1 more source

An approach to minimization of decision diagrams

Proceedings Euromicro Symposium on Digital Systems Design, 2002
One of the most promising concepts which has been developed for efficient representation functions is Linearly Transformed Binary Decision Diagram (LTBDD). We present extensions to LTBDDs called Function-driven Decision Diagrams (fDDs). The notion of fDDs is based on using simple balanced (including nonlinear) Boolean functions for defining ...
openaire   +1 more source

On CNF Encodings of Decision Diagrams

2016
Decisions diagrams such as Binary Decision Diagrams (BDDs), Multi-valued Decision Diagrams (MDDs) and Negation Normal Forms (NNFs) provide succinct ways of representing Boolean and other finite functions. Hence they provide a powerful tool for modelling complex constraints in discrete satisfaction and optimization problems.
Ignasi Abío, Graeme Gange, Valentin Mayer-Eichberger, Peter J. Stuckey   +3 more
openaire   +1 more source

Superset Generation on Decision Diagrams

2015
Generating all supersets from a given set family is important, because it is closely related to identifying cause-effect relationship. This paper presents an efficient method for superset generation by using the compressed data structures BDDs and ZDDs effectively. We analyze the size of a BDD that represents all supersets. As a by-product, we obtain a
Takahisa Toda, Shogo Takeuchi, Koji Tsuda, Shin-ichi Minato   +3 more
openaire   +1 more source

Decision Diagrams and Dynamic Programming

2013
Binary and multivalued decision diagrams are closely related to dynamic programming (DP) but differ in some important ways. This paper makes the relationship more precise by interpreting the DP state transition graph as a weighted decision diagram and incorporating the state-dependent costs of DP into the theory of decision diagrams.
openaire   +1 more source

Sequence Sentential Decision Diagrams

2018
In this paper, we propose a new data structure sequence sentential decision diagram (SSDD) that represents sets of strings. SSDD is a generalized data structure of Sequence Binary Decision Diagram (SeqBDD), that is a similar data structure to a deterministic finite automaton, but the size can be exponentially smaller than the SeqBDD for the same string
openaire   +1 more source