Biconditional Binary Decision Diagrams: A Novel Canonical Logic Representation Form
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Inspired by the basic processes of molecular biology, our previous studies resulted in defining a configurable molecule implementing self-replication and self-repair mechanisms made up of simple processes. The goal of our paper is to add error detection fe ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
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. the size may ...
Institute of Electrical and Electronics Engineers2009
For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions, there is a corresponding Omega(n log n) lower bound. All this ...
In this paper we consider discrete-time piecewise affine hybrid systems with Boolean inputs, outputs and states and we show that they can be represented in a canonical form where the logic variables influence the switching between different submodels but n ...
Formal verification of microprocessors requires a mechanism for efficient representation and manipulation of both arithmetic and random Boolean functions. Recently, a new canonical and graph-based representation called TED has been introduced for verificat ...
In this paper we consider discrete-time piecewise affine hybrid systems with boolean inputs, outputs and states and show that they can be represented in a logic canonical form where the logic variables influence the switching between different submodels bu ...
Let n > 2 be even; r >= 1 be an integer; 0 < alpha < 1; Omega be a bounded, connected, smooth, open set in R-n; and nu be its exterior unit normal. Let f, g is an element of C-r,C-alpha((Omega) over bar; Lambda(2)) be two symplectic forms (i.e., closed and ...
Biconditional Binary Decision Diagrams (BBDDs) are a novel class of binary decision diagrams where the branching condition, and its associated logic expansion, is biconditional on two variables. Reduced and ordered BBDDs are remarkably compact and unique f ...
We present a novel class of decision diagrams, called Biconditional Binary Decision Diagrams (BBDDs), that enable efficient logic synthesis for XOR-rich functions. BBDDs are binary decision diagrams where the Shannon’s expansion is replaced by the bicondit ...
Most hardware predictors are table based (e.g. two-level branch predictors) and have exponential size growth in the number of input bits or features (e.g. previous branch outcomes). This growth severely limits the amount of predictive information that such ...
