Publication

Restructuring of Arithmetic Circuits with Biconditional Binary Decision Diagrams

2014
Posters

Abstract

Biconditional Binary Decision Diagrams (BBDDs) are a novel class of canonical binary decision diagrams where the branching condition, and its associated logic expansion is biconditional on two variables. In this demonstration we use an efficient BBDD manipulation package as front-end to a commercial synthesis tool to restructure arithmetic operations in critical components of telecommunication circuits. We show that our approach meets tight timing constraints otherwise beyond the capabilities of traditional synthesis methods.

Official source

Graph Chat

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.

2014
Posters

Abstract

Official source

Related concepts (24)

Binary decision diagram

In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered as a compressed representation of sets or relations. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression. Similar data structures include negation normal form (NNF), Zhegalkin polynomials, and propositional directed acyclic graphs (PDAG).

Logical biconditional

In logic and mathematics, the logical biconditional, also known as material biconditional or equivalence or biimplication or bientaiment, is the logical connective used to conjoin two statements and to form the statement " if and only if " (often abbreviated as " iff "), where is known as the antecedent, and the consequent. Nowadays, notations to represent equivalence include . is logically equivalent to both and , and the XNOR (exclusive nor) boolean operator, which means "both or neither".

Boolean circuit

In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length. Boolean circuits are defined in terms of the logic gates they contain. For example, a circuit might contain binary AND and OR gates and unary NOT gates, or be entirely described by binary NAND gates. Each gate corresponds to some Boolean function that takes a fixed number of bits as input and outputs a single bit.

Related publications (3)

Restructuring of Arithmetic Circuits with Biconditional Binary Decision Diagrams

Chat with Graph Search

Alkynylation with Hypervalent Iodine Reagents

The Role of Synthesis Constraints in Role Modeling

On the Power of Democratic Networks