Publication

Biconditional Binary Decision Diagrams: A Novel Canonical Logic Representation Form

Publications associées (42)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

An Efficient Manipulation Package for Biconditional Binary Decision Diagrams

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

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 ...

IEEE2014

Biconditional BDD: A Novel Canonical BDD for Logic Synthesis targeting XOR-rich Functions

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

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 ...

2013

A Global Version Of The Darboux Theorem With Optimal Regularity And Dirichlet Condition

Bernard Dacorogna, Olivier Kneuss

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 ...

2011

Bio-Inspired Self-Testing and Self-Organizing Processing Arrays

Joël Rossier

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

Approximate BDD Minimization by Weighted A*

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

Faster Integer Multiplication

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 ...

2009

Dynamic feature selection for hardware prediction

Babak Falsafi

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 ...

2006

TED+: A Data Structure for Microprocessor Verification

Pejman Lotfi Kamran

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 ...

2005

Lagrange Stability and Performance Analysis of Discrete-Time Piecewise Affine Systems with Logic States

Giancarlo Ferrari Trecate

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 ...

2003

Analysis of Piecewise Affine Systems with Logic States

Giancarlo Ferrari Trecate

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 ...

Springer-Verlag2002