Results 141 to 150 of about 240,562 (189)

Timed binary decision diagrams

Proceedings International Conference on Computer Design VLSI in Computers and Processors, 2002
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.
null Zhongcheng Li, null Yuhong Zhao, null Yinghua Min, R.K. Brayton   +3 more
openaire   +1 more source

Binary Decision Diagram (BDD)

2009 International Conference on Future Computer and Communication, 2009
the primary aim of computer science is invention of new data structures and algorithms. Those data structures and algorithms could significantly help us to solve unsolved problems or let us give much better solutions for the already solved problems. In this paper we introduce BDD (Binary Decision Diagram) and its variants OBDD (Ordered Binary Decision ...
Farnaz Towhidi, Arash Habibi Lashkari, Raheleh Sadat Hosseini   +2 more
openaire   +1 more source

Binary Decision Diagrams

IEEE Transactions on Computers, 1978
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary decision diagram. This diagram provides a complete, concise, "implementation-free" description of the digital functions involved.
openaire   +2 more sources

Binary-decision-diagram device

IEEE Transactions on Electron Devices, 1995
The device proposed here for future LSI's is based on a concept different from the Boolean equations usually used for representing digital functions. The unit function of this device is simple two-way switching and can be implemented utilizing various physical effects, such as optical switching, electron-wave modulation, and single-electron transport ...
N. Asahi, M. Akazawa, Y. Amemiya
openaire   +1 more source

Ordered Binary Decision Diagrams

1992
In order to facilitate a detailed study of the perturbations of various fault models on the normal functioning of a given circuit, it is helpful to have the capacity to find all the tests for each fault in a fault set. One procedure to gather this information would be to inject each fault in the fault set, one at a time, and simulate all possible input
Kenneth M. Butler, M. Ray Mercer
openaire   +1 more source

Binary Decision Diagram

2011
A binary decision diagram is a directed acyclic graph that consists of nodes and edges. It deals with Boolean functions. A binary decision diagram consists of a set of decision nodes, starting at the root node at the top of the decision diagram. Each decision node contains two outgoing branches, one is a high branch and the other is a low branch. These
openaire   +1 more source

Factorization using binary decision diagrams

Cryptography and Communications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Håvard Raddum, Srimathi Varadharajan
openaire   +1 more source

Dynamically resizable binary decision diagrams

Proceedings of the 20th symposium on Great lakes symposium on VLSI, 2010
We present the architecture of a new Ordered Binary Decision Diagram library that is designed from the ground up to be space efficient. The main novelty lies in the library's node structure, which is modified at run-time to closely follow the variations in size of the stored OBDDs.
Stergios Stergiou, Jawahar Jain
openaire   +1 more source

Binary Decision Diagrams

2018
Binary decision diagrams provide a data structure for representing and manipulating Boolean functions in symbolic form. They have been especially effective as the algorithmic basis for symbolic model checkers. A binary decision diagram represents a Boolean function as a directed acyclic graph, corresponding to a compressed form of decision tree.
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