Výsledky vyhľadávania - Single-output boolean functions

  1. 1

    Field Programmable Gate Array Hardware Accelerator of Prime Implicants Generation for Single-Output Boolean Functions Minimization Autor Mados, B., Bilanova, Z., Chovancova, E., Adam, N.

    Vydavateľské údaje: IEEE 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. 2

    Simplification of Single-Output Boolean Functions by Exact Direct Cover Algorithm Based on Cube Algebra Autor Basciftci, F.

    ISBN: 9781424408122, 1424408121
    Vydavateľské údaje: IEEE 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. 3

    An Off-Cubes Expanding Approach to the Problem of Separate Determination of the Essential Prime Implicants of the Single-Output Boolean Functions Autor Basciftci, F., Kahramanli, S.

    ISBN: 9781424408122, 1424408121
    Vydavateľské údaje: IEEE 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. 4

    Optimizing AES Threshold Implementation Under the Glitch-Extended Probing Model Autor Yao, Fu, Chen, Hua, Wei, Yongzhuang, Pasalic, Enes, Zhou, Feng, Fan, Limin

    ISSN: 0278-0070, 1937-4151
    Vydavateľské údaje: New York IEEE 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. 5

    A Quantum Method to Match Vector Boolean Functions using Simon's Solver Autor Venere, Marco, Barenghi, Alessandro, Pelosi, Gerardo

    ISSN: 2576-6996
    Vydavateľské údaje: IEEE 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. 6

    Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling Autor Beg, Azam, Chandana Prasad, P.W., Beg, Ajmal

    ISSN: 0957-4174, 1873-6793
    Vydavateľské údaje: Elsevier Ltd 01.05.2008
    Vydané 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. 7

    Broadcasting on Two-Dimensional Regular Grids Autor Makur, Anuran, Mossel, Elchanan, Polyanskiy, Yury

    ISSN: 0018-9448, 1557-9654
    Vydavateľské údaje: New York IEEE 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. 8

    A Heuristic Boolean NPN Equivalent Matching Verification Method Based on Shannon Decomposition Autor Zhang, Juling, Guo, Wenqiang, Yang, Guowu, Zhu, Yixin, Lv, Xiaoyi

    ISSN: 2169-3536, 2169-3536
    Vydavateľské údaje: Piscataway IEEE 2022
    Vydané 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. 9

    On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication Autor Bryant, R.E.

    ISSN: 0018-9340
    Vydavateľské údaje: New York, NY IEEE 01.02.1991
    Vydané 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. 10

    Methodologies for Quantum Circuit and Algorithm Design at Low and High Levels Autor Tsai, Edison

    ISBN: 9798837520044
    Vydavateľ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. 11

    An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion Autor Zhang, Juling, Yang, Guowu, Hung, William N. N., Zhang, Yan, Wu, Jinzhao

    ISSN: 1386-7857, 1573-7543
    Vydavateľské údaje: New York Springer US 01.05.2019
    Vydané 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. 12

    Large-scale design of robust genetic circuits with multiple inputs and outputs for mammalian cells Autor Weinberg, Benjamin H, Pham, N T Hang, Caraballo, Leidy D, Lozanoski, Thomas, Engel, Adrien, Bhatia, Swapnil, Wong, Wilson W

    ISSN: 1087-0156, 1546-1696, 1546-1696
    Vydavateľské údaje: New York Springer New York 01.05.2017
    Vydané 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. 13

    Asynchronous Signalling Processes Autor Manohar, Rajit, Moses, Yoram

    ISSN: 2643-1483
    Vydavateľské údaje: IEEE 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. 14

    High-level area and power estimation for VLSI circuits Autor Nemani, M., Najm, F.N.

    ISSN: 0278-0070
    Vydavateľské údaje: New York, NY IEEE 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. 15

    Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule Autor Basciftci, Fatih, Kahramanli, Sirzat

    ISSN: 0965-9978
    Vydavateľské údaje: Elsevier Ltd 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. 16

    FPGA area reduction by multi-output function based sequential resynthesis Autor Hu, Yu, Shih, Victor, Majumdar, Rupak, He, Lei

    ISBN: 1605581151, 9781605581156
    ISSN: 0738-100X
    Vydavateľské údaje: New York, NY, USA ACM 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. 17

    Itemization and Track Limitations of Fan-Out-Free Functions for Static CMOS Functional Cells Autor Brunhaver, John, Uhrie, Richard, Clark, Lawrence T.

    ISSN: 1549-7747, 1558-3791
    Vydavateľské údaje: New York IEEE 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. 18

    Quantum Machine Learning Based on Minimizing Kronecker-Reed-Muller Forms and Grover Search Algorithm with Hybrid Oracles Autor Lee, Bryan, Perkowski, Marek

    Vydavateľské údaje: IEEE 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. 19

    Extracting reaction systems from function behavior Autor Genova, Daniela, Hoogeboom, Hendrik Jan, Prodanoff, Zornitza

    ISSN: 2523-8906, 2523-8914
    Vydavateľské údaje: Singapore Springer Singapore 01.10.2020
    Vydané 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. 20

    Permissible functions for multioutput components in combinational logic optimization Autor Watanabe, Y., Guerra, L.M., Brayton, R.K.

    ISSN: 0278-0070
    Vydavateľské údaje: New York, NY IEEE 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