Results 11 to 20 of about 2,176 (251)

Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams

Журнал Белорусского государственного университета: Математика, информатика, 2021
The problem of synthesis and optimisation of logical reversible and quantum circuits from functional descriptions represented as decision diagrams is considered.
Anatoly A. Prihozhy
doaj   +1 more source

Approximate BDD Minimization by Weighted A* [PDF]

, 2008
Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e.
Rudiger Ebendt, Ebendt, Rüdiger, Rolf Drechsler, Drechsler, Rolf   +3 more
core   +1 more source

Efficient Set Sharing Using ZBDDs [PDF]

, 2008
Set sharing is an abstract domain in which each concrete object is represented by the set of local variables from which it might be reachable. It is a useful abstraction to detect parallelism opportunities, since it contains definite information about ...
Mario Méndez-Lojo, Manuel V. Hermenegildo, Hermenegildo, Manuel V., Ondřej Lhoták, Lhoták, Ondrej, Méndez-Lojo, Mario   +5 more
core   +2 more sources

Partially Programmable Circuit Design Oriented to masking Trojan Circuits

Труды Института системного программирования РАН, 2018
The enhanced utilization of outsourcing services for a part of VLSIs (Intellectual Property cores, reprogramming components based on FPGA and so on) to cut VLSI cost increases risk of inserting Trojan Circuits (TCs) that may destroy VLSI or provide ...
A. Yu. Matrosova, S. A. Ostanin, E. A. Nikolaeva   +2 more
doaj   +1 more source

Topology planning for autonomous MMGs: an ordered binary decision diagram-based approach

IET Smart Grid, 2019
This paper finds its motivation from the perspective of utility planners, where the flexibility of choice while reconfiguring a distribution system into Multi-Micrgrids (MMGs) is critical.
Hafiz Anwar Ullah Khan, Mohamed Al Hosani, Mohamed Al Hosani, Hatem Zeineldin   +3 more
doaj   +1 more source

Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation

Journal of Applied Mathematics, 2015
We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA) into Büchi Automata (BA) different from the standard degeneralization algorithm.
Laixiang Shan, Jun Qin, Mingshi Chen, Zheng Qin   +3 more
doaj   +1 more source

Size of ordered binary decision diagrams representing threshold functions [PDF]

, 1997
An ordered binary decision diagram (OBDD) is a graph representation of a Boolean function. In this paper, the size of ordered binary decision diagrams representing threshold functions is discussed. We consider two cases: the case when a variable ordering
Kaneda, T., Yajima, S., Hosaka, K., Takenaga, Y.   +3 more
core   +1 more source

Hardness of identifying the minimum ordered binary decision diagram

Discrete Applied Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yasuhiko Takenaga, Shuzo Yajima
openaire   +1 more source

Quantum and classical nondeterministic OBDDs

Учёные записки Казанского университета: Серия Физико-математические науки
A model of nondeterministic ordered binary decision diagrams (NOBDDs) was analyzed. A method for proving a lower bound on the complexity of quantum NOBDDs was developed.
A. F. Gainutdinova
doaj   +1 more source

Prover - Toward More Efficient Formal Verification of Masking in Probing Model

Transactions on Cryptographic Hardware and Embedded Systems
In recent years, formal verification has emerged as a crucial method for assessing security against Side-Channel attacks of masked implementations, owing to its remarkable versatility and high degree of automation.
Feng Zhou, Hua Chen, Limin Fan
doaj   +1 more source