Výsledky vyhľadávania - Single-output boolean functions
-
1
Field Programmable Gate Array Hardware Accelerator of Prime Implicants Generation for Single-Output Boolean Functions Minimization
Vydavateľské údaje: IEEE 01.11.2019Vydané v 2019 17th International Conference on Emerging eLearning Technologies and Applications (ICETA) (01.11.2019)“…The paper deals with the problematics of two-level single-output Boolean functions minimization which is important for many fields of science and technology including logic and control systems design…”
Získať plný text
Konferenčný príspevok.. -
2
Simplification of Single-Output Boolean Functions by Exact Direct Cover Algorithm Based on Cube Algebra
ISBN: 9781424408122, 1424408121Vydavateľské údaje: IEEE 01.09.2007Vydané v EUROCON 2007 - the International Conference on Computer as a Tool (01.09.2007)“…Due to the nature of the exact two-level Boolean functions minimization methods most of practical applications rely on heuristic ones that are generally realized by a three step cyclic algorithm…”
Získať plný text
Konferenčný príspevok.. -
3
An Off-Cubes Expanding Approach to the Problem of Separate Determination of the Essential Prime Implicants of the Single-Output Boolean Functions
ISBN: 9781424408122, 1424408121Vydavateľské údaje: IEEE 01.09.2007Vydané v EUROCON 2007 - the International Conference on Computer as a Tool (01.09.2007)“…The goal of this study is the avoidance of excessive amount of temporary results produced during the minimization process of the two-level single-output Boolean functions of many variables…”
Získať plný text
Konferenčný príspevok.. -
4
Optimizing AES Threshold Implementation Under the Glitch-Extended Probing Model
ISSN: 0278-0070, 1937-4151Vydavateľské údaje: New York IEEE 01.07.2024Vydané v IEEE transactions on computer-aided design of integrated circuits and systems (01.07.2024)“… (under the presence of glitches) for a given encryption algorithm. Although it handles well single-output Boolean functions, this method has to store output shares in registers…”
Získať plný text
Journal Article -
5
A Quantum Method to Match Vector Boolean Functions using Simon's Solver
ISSN: 2576-6996Vydavateľské údaje: IEEE 18.11.2024Vydané v Proceedings - IEEE International Conference on Computer Design (18.11.2024)“… In particular, the equivalence under negation-permutation-negation of two n-to-n vector Boolean functions requires the exploration of a super-exponential number of possible negations and permutations…”
Získať plný text
Konferenčný príspevok.. -
6
Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling
ISSN: 0957-4174, 1873-6793Vydavateľské údaje: Elsevier Ltd 01.05.2008Vydané v Expert systems with applications (01.05.2008)“…), we conducted experiments for a large number of randomly generated single output Boolean functions (BFs…”
Získať plný text
Journal Article -
7
Broadcasting on Two-Dimensional Regular Grids
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.10.2022Vydané v IEEE transactions on information theory (01.10.2022)“…We study an important specialization of the general problem of broadcasting on directed acyclic graphs, namely, that of broadcasting on two-dimensional (2D)…”
Získať plný text
Journal Article -
8
A Heuristic Boolean NPN Equivalent Matching Verification Method Based on Shannon Decomposition
ISSN: 2169-3536, 2169-3536Vydavateľské údaje: Piscataway IEEE 2022Vydané v IEEE access (2022)“…) Boolean matching for a single-output completely specified Boolean function. Through research on the Boolean Shannon decomposition binary tree, we prove…”
Získať plný text
Journal Article -
9
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
ISSN: 0018-9340Vydavateľské údaje: New York, NY IEEE 01.02.1991Vydané v IEEE transactions on computers (01.02.1991)“… It is shown that the same technique used to prove that any VLSI implementation of a single output Boolean function has area-time complexity AT/sup 2/= Omega (n/sup 2…”
Získať plný text
Journal Article -
10
Methodologies for Quantum Circuit and Algorithm Design at Low and High Levels
ISBN: 9798837520044Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2022“…Although the concept of quantum computing has existed for decades, the technology needed to successfully implement a quantum computing system has not yet…”
Získať plný text
Dissertation -
11
An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion
ISSN: 1386-7857, 1573-7543Vydavateľské údaje: New York Springer US 01.05.2019Vydané v Cluster computing (01.05.2019)“…An efficient pairwise Boolean matching algorithm for solving the problem of matching single-output specified Boolean functions under input negation and/or input permutation and/or output negation (NPN…”
Získať plný text
Journal Article -
12
Large-scale design of robust genetic circuits with multiple inputs and outputs for mammalian cells
ISSN: 1087-0156, 1546-1696, 1546-1696Vydavateľské údaje: New York Springer New York 01.05.2017Vydané v Nature biotechnology (01.05.2017)“… We present a robust, general, scalable system, called 'Boolean logic and arithmetic through DNA excision' (BLADE…”
Získať plný text
Journal Article -
13
Asynchronous Signalling Processes
ISSN: 2643-1483Vydavateľské údaje: IEEE 01.05.2019Vydané v Proceedings / International Symposium on Asynchronous Circuit and Systems (01.05.2019)“… Consequently, the computational power of such a network is severely limited. This establishes that the celebrated C-element property of DI circuits follows solely from the fact that single output modules communicate over stable asynchronous wires. Conversely, it is shown that any Boolean function can be implemented using four input/two-output processes where every process is either one gate (single output) or a pair of gates (two output)…”
Získať plný text
Konferenčný príspevok.. -
14
High-level area and power estimation for VLSI circuits
ISSN: 0278-0070Vydavateľské údaje: New York, NY IEEE 01.06.1999Vydané v IEEE transactions on computer-aided design of integrated circuits and systems (01.06.1999)“… The proposed area model is based on transforming the multi-output Boolean function description into an equivalent single output function…”
Získať plný text
Journal Article -
15
Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule
ISSN: 0965-9978Vydavateľské údaje: Elsevier Ltd 01.06.2011Vydané v Advances in engineering software (1992) (01.06.2011)“…In this study, a novel OFF-set based direct-cover Exact Minimization Algorithm (EMA) is proposed for single-output Boolean functions represented in a sum-of-products form…”
Získať plný text
Journal Article -
16
FPGA area reduction by multi-output function based sequential resynthesis
ISBN: 1605581151, 9781605581156ISSN: 0738-100XVydavateľské údaje: New York, NY, USA ACM 08.06.2008Vydané v 2008 45th ACM/IEEE Design Automation Conference (08.06.2008)“…We propose a new resynthesis algorithm for FPGA area reduction. In contrast to existing resynthesis techniques, which consider only single-output Boolean…”
Získať plný text
Konferenčný príspevok.. -
17
Itemization and Track Limitations of Fan-Out-Free Functions for Static CMOS Functional Cells
ISSN: 1549-7747, 1558-3791Vydavateľské údaje: New York IEEE 01.07.2019Vydané v IEEE transactions on circuits and systems. II, Express briefs (01.07.2019)“…The inverting subset of fan-out-free boolean functions describe the majority of implementable single-output combinatorial static CMOS gates…”
Získať plný text
Journal Article -
18
Quantum Machine Learning Based on Minimizing Kronecker-Reed-Muller Forms and Grover Search Algorithm with Hybrid Oracles
Vydavateľské údaje: IEEE 01.08.2016Vydané v 2016 Euromicro Conference on Digital System Design (DSD) (01.08.2016)“… The classical binary logic synthesis problem can be modeled to minimize a single output Boolean function with a two-level structure consisting of an exclusive-OR (EXOR…”
Získať plný text
Konferenčný príspevok.. -
19
Extracting reaction systems from function behavior
ISSN: 2523-8906, 2523-8914Vydavateľské údaje: Singapore Springer Singapore 01.10.2020Vydané v Journal of membrane computing (01.10.2020)“… We propose several approaches, based on identifying reaction systems with Boolean functions, Boolean formulas, and logic circuits…”
Získať plný text
Journal Article -
20
Permissible functions for multioutput components in combinational logic optimization
ISSN: 0278-0070Vydavateľské údaje: New York, NY IEEE 01.07.1996Vydané v IEEE transactions on computer-aided design of integrated circuits and systems (01.07.1996)“… In the light of theoretical work of the past years, where a circuit is modeled by a Boolean network in which each node implements a single-output Boolean function, we address how a concurrent…”
Získať plný text
Journal Article

