Results 71 to 80 of about 240,562 (189)

EMPLOYING COMPLEXITY ESTIMATES OF BINARY DECISION DIAGRAMS IN THE SYNTHESIS OF LOGICAL CIRCUITS

Informatika, 2016
A formula is suggested to evaluate the area of a logical circuit that is built in a given library of logical elements according to the BDD (Binary Decision Diagram) representation of a system of Boolean functions. The experimental results of synthesis of
N. A. Avdeev, P. N. Bibilo
doaj  

Formal Verification Method of CTCS-2 Level Train Control Engineering Data Based on the Reduced Ordered Binary Decision Diagram

IEEE Access
The precise generation of train control curves for the on-board Automatic Train Protection (ATP) of the Chinese Train Control System Level 2 (CTCS-2) relies significantly on accurate train control engineering data, which serves as a critical element in ...
Hao Zhang, Qing Xu, Ke Ye
doaj   +1 more source

BDD-Based Topology Optimization for Low-Power DTIG FinFET Circuits

Active and Passive Electronic Components, 2019
This paper proposed a logic synthesis method based on binary decision diagram (BDD) representation. The proposed method is optimized for dual-threshold independent-gate (DTIG) FinFET circuits.
Haiyan Ni, Jianping Hu, Xuqiang Zhang, Haotian Zhu   +3 more
doaj   +1 more source

Unequal Error Protection QPSK Modulation Codes [PDF]

, 1992
The authors use binary linear UEP (LUEP) codes, in combination with a QPSK signal set and Gray mapping, to obtain new efficient block QPSK modulation codes with unequal minimum squared Euclidean distances.
Lin, Shu, Morelos-Zaragoza, Robert H
core   +1 more source

Ordered Functional Decision Diagrams: A Functional Semantics For Binary Decision Diagrams

, 2020
We introduce a novel framework, termed $ $DD, that revisits Binary Decision Diagrams from a purely functional point of view. The framework allows to classify the already existing variants, including the most recent ones like Chain-DD and ESRBDD, as implementations of a special class of ordered models.
Thibault, Joan, Ghorbal, Khalil
openaire   +2 more sources

Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC

Informatika
Objectives. The problem of choosing the best methods and programs for circuit implementation as part of digital ASIC (Application-Specific Integrated Circuit) sparse systems of disjunctive normal forms (DNF) of completely defined Boolean functions is ...
P. N. Bibilo, S. N. Kardash
doaj   +1 more source

Learning ordered binary decision diagrams

, 1995
We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output ...
Gavaldà Mestre, Ricard, Guijarro Guillem, David   +1 more
openaire   +3 more sources

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

Integrated Methodology for Software Reliability Analysis [PDF]

Informatică economică, 2012
The most used techniques to ensure safety and reliability of the systems are applied together as a whole, and in most cases, the software components are usually overlooked or to little analyzed.
Marian Pompiliu CRISTESCU, Laurentiu CIOVICA, Liviu CIOVICA   +2 more
doaj  

Algorithms for extracting subsystems from a multilevel representation of a system of Boolean functions for joint minimization

Informatika
Objectives. The purpose of experimental research is to determine the effectiveness of new algorithms for extracting the so-called connected subsystems from formula descriptions of the original system of Boolean functions.
P. N. Bibilo, N. A. Kirienko, V. I. Romanov   +2 more
doaj   +1 more source