Results 211 to 220 of about 50,489 (260)
Some of the next articles are maybe not open access.
Timed binary decision diagrams
Proceedings International Conference on Computer Design VLSI in Computers and Processors, 1997The 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 +3 more
openaire +1 more source
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
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
2020
An effective way to represent logic functions is the Binary Decision Diagram (BDD). The prototype of the BDD was the Binary Decision Programs (BDP), in which different nodes in a given path can be assigned the same variable.
Marcin Kubica, Adam Opara, Dariusz Kania
openaire +1 more source
An effective way to represent logic functions is the Binary Decision Diagram (BDD). The prototype of the BDD was the Binary Decision Programs (BDP), in which different nodes in a given path can be assigned the same variable.
Marcin Kubica, Adam Opara, Dariusz Kania
openaire +1 more source
Automata and Binary Decision Diagrams
1999We show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant.
Jean-Francis Michon +1 more
openaire +1 more source
A characterization of binary decision diagrams
IEEE Transactions on Computers, 1993Binary 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
Binary decision diagrams in theory and practice
International Journal on Software Tools for Technology Transfer, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rolf Drechsler, Detlef Sieling
openaire +1 more source
Dynamically resizable binary decision diagrams
Proceedings of the 20th symposium on Great lakes symposium on VLSI, 2010We 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 and neural networks
The Journal of Supercomputing, 2007This paper describes a neural network approach that gives an estimation method for the space complexity of Binary Decision Diagrams (BDDs). A model has been developed to predict the complexity of digital circuits. The formal core of the developed neural network model (NNM) is a unique matrix for the complexity estimation over a set of BDDs derived from
P. W. Chandana Prasad +2 more
openaire +1 more source
Factorization using binary decision diagrams
Cryptography and Communications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Håvard Raddum, Srimathi Varadharajan
openaire +1 more source