Results 31 to 40 of about 97,350 (281)

TeDDy: Templated decision diagram library

SoftwareX
Discrete functions are an integral part of numerous areas of research in mathematics and computer science. Efficient processing of such functions in a computer requires an appropriate representation.
Michal Mrena, Miroslav Kvassay, Elena Zaitseva   +2 more
doaj   +1 more source

Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors

Informatika, 2021
In the systems of digital VLSI design (Very Large Integrated Circuits), the BDD (Binary Decision Diagram) is used for VLSI verification, as well as for technologically independent optimization as the first stage in the synthesis of logic circuits in ...
P. N. Bibilo, V. I. Romanov
doaj   +1 more source

Optimal Maintenance Management of Offshore Wind Farms

Energies, 2016
Nowadays offshore wind energy is the renewable energy source with the highest growth. Offshore wind farms are composed of large and complex wind turbines, requiring a high level of reliability, availability, maintainability and safety (RAMS).
Alberto Pliego Marugán, Fausto Pedro García Márquez, Jesús María Pinar Pérez   +2 more
doaj   +1 more source

Chain Reduction for Binary and Zero-Suppressed Decision Diagrams

, 2017
Chain reduction enables reduced ordered binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) to each take advantage of the others' ability to symbolically represent Boolean functions in compact form.
Bryant, DE Knuth, F Somenzi, M Hansen, RE Bryant, S Minato   +5 more
core   +1 more source

A Recursive Framework for Evaluating Moments Using Zero-Suppressed Binary Decision Diagrams

IEEE Access
The zero-suppressed binary decision diagram (ZDD) is a compact data structure widely used for the efficient representation of families of sparse subsets.
Brian Godwin Lim, Renzo Roel Tan, Jun Kawahara, Shin-Ichi Minato, Kazushi Ikeda   +4 more
doaj   +1 more source

Formal Methods for Exact Analysis of Approximate Circuits

IEEE Access, 2019
Approximate circuits are digital circuits that are intentionally designed in such a way that the specification is violated in terms of functionality in order to obtain some improvements in power consumption, performance or area, in comparison with fully ...
Zdenek Vasicek
doaj   +1 more source

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
core   +1 more source

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests [PDF]

, 2014
We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea
Bouajjani A., Goel A., Henriksen J. G., Hopcroft J. E., Huet G., Kozen D., Kozen D., Moore E. F., Pottier F., Pous D., Rémy D.   +10 more
core   +5 more sources

Gate-Level Simulation of Quantum Circuits [PDF]

, 2002
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design.
George F. Viamontes, Igor L. Markov, John, John P. Hayes, Manoj Rajagopalan   +4 more
core   +5 more sources

Binary Decision Diagrams by Shared Rewriting [PDF]

, 2000
In this paper we propose a uniform description of basic BDD theory and algorithms by means of term rewriting. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical forms can be obtained. Various reduction strategies give rise to different algorithms.
Pol, J. van de, Zantema, H.
openaire   +3 more sources