Results 21 to 30 of about 9,112 (162)

Novel Reduction Methods for Decision Diagrams

open access: yesIEEE Access, 2023
We propose a novel method of reduction for binary-based decision diagrams (DD) exploiting the similarities between Boolean functions. Conventional methods are able to remove redundant parts of DD that adhere to (or represent) identical structures.
Jan Lucansky, Ivan Kotuliak
doaj   +1 more source

Compressing Binary Decision Diagrams

open access: yes, 2008
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node.
Hansen, Esben Rune   +2 more
openaire   +2 more sources

Optimal Maintenance Management of Offshore Wind Farms

open access: yesEnergies, 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   +2 more
doaj   +1 more source

Binary decision diagram‐based synthesis technique for improved mapping of Boolean functions inside memristive crossbar‐slices

open access: yesIET Computers & Digital Techniques, 2021
Memristors are two‐terminal nano‐electronic devices that make it possible to design non‐volatile memory and logic circuits with high integration density.
Anindita Chakraborty   +5 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

open access: yesInformatika, 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

Masking of Internal Nodes Faults Based on Applying of Incompletely Specified Boolean Functions [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020
Combinational circuits (combinational parts of sequential circuits) are considered. Masking of internal nodes faults with applying sub-circuit, inputs of which are connected to the circuit inputs and outputs — to the circuit proper internal nodes, is ...
Matrosova, Angela Yu.   +2 more
doaj   +1 more source

TeDDy: Templated decision diagram library

open access: yesSoftwareX
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   +2 more
doaj   +1 more source

Formal Methods for Exact Analysis of Approximate Circuits

open access: yesIEEE 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

Optimizing Binary Decision Diagrams with MaxSAT for Classification

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2022
The growing interest in explainable artificial intelligence(XAI) for critical decision making motivates the need for interpretable machine learning (ML) models. In fact, due to their structure (especially with small sizes), these models are inherently understandable by humans.
Hu, Hao   +2 more
openaire   +3 more sources

Lattice-Valued Binary Decision Diagrams [PDF]

open access: yes, 2010
This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functions of the form θ : 2P → L, where P is a finite set of Boolean propositions and L is a finite distributive lattice.
Geeraerts, Gilles   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy