Abstract To present a novel logic synthesis method to reduce the area of XOR-based logic functions. Idea: To exploit linear dependency between logic sub-

Slides:



Advertisements
Similar presentations
Hybrid BDD and All-SAT Method for Model Checking Orna Grumberg Joint work with Assaf Schuster and Avi Yadgar Technion – Israel Institute of Technology.
Advertisements

Logic Gates.
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.
ECE Synthesis & Verification 1 ECE 667 Synthesis and Verification of Digital Systems Formal Verification Combinational Equivalence Checking.
Functionally Linear Decomposition and Synthesis (FLDS) of Logic Circuits for S. Czajkowski and Stephen D. Brown,IEEE TRANSACTIONS ON COMPUTER-AIDED.
Efficient Reachability Analysis for Verification of Asynchronous Systems Nishant Sinha.
1 Don´t Care Minimization of *BMDs: Complexity and Algorithms Christoph Scholl Marc Herbstritt Bernd Becker Institute of Computer Science Albert-Ludwigs-University.
Grouping Heuristics for Word-Level Decision Diagrams Rolf DrechslerMarc HerbstrittBernd Becker Institute of Computer Science University of Freiburg
DATE-2002TED1 Taylor Expansion Diagrams: A Compact Canonical Representation for Symbolic Verification M. Ciesielski, P. Kalla, Z. Zeng B. Rouzeyre Electrical.
ELEN 468 Lecture 121 ELEN 468 Advanced Logic Design Lecture 12 Synthesis of Combinational Logic I.
Derivatives of Perkowski’s Gate k f2 g h t t De Vos gates  f1f1  A B P Q Feynman gates A B P f 2f 2  C Q R Toffoli gates Q P f 2 A C R B S D 0.
ECE Synthesis & Verification - Lecture 18 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems Word-level.
1 BDS: A BDD-Based Logic Optimization System “BDS: A BDD-Based Logic Optimization System”, by Congguang Yang and Maciej Ciesielski, 2000 By Chang Seok.
Rolf Drechlser’s slides used
Lattice Diagrams using Reed-Muller Logic Shim, Hee Jun.
Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.
ECE Synthesis & Verification - L211 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems Verification Equivalence checking.
2002/10/08 SeonPil Kim Layout-Driven Synthesis For Submicron Technology : Mapping Expansions To Regular Lattices High Level Synthesis Homework #2.
ECE Synthesis & Verification - Lecture 14 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems BDD-based.
Multiplexer as a Universal Function Generator
Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.
ECE Synthesis & Verification - Lecture 10 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems Binary.
 2001 CiesielskiBDD Tutorial1 Decision Diagrams Maciej Ciesielski Electrical & Computer Engineering University of Massachusetts, Amherst, USA
Logic Synthesis 3 1 Logic Synthesis Part III Maciej Ciesielski Univ. of Massachusetts Amherst, MA.
ECE 667 Synthesis & Verification - BDD 1 ECE 667 ECE 667 Synthesis and Verification of Digital Systems Binary Decision Diagrams (BDD)
Minimization Techniques for Reversible Logic Synthesis.
 2000 M. CiesielskiPTL Synthesis1 Synthesis for Pass Transistor Logic Maciej Ciesielski Dept. of Electrical & Computer Engineering University of Massachusetts,
Chapter 8. Linear Systems with Random Inputs 1 0. Introduction 1. Linear system fundamentals 2. Random signal response of linear systems Spectral.
Fast Spectral Transforms and Logic Synthesis DoRon Motter August 2, 2001.
Logic Decomposition ECE1769 Jianwen Zhu (Courtesy Dennis Wu)
Digital Logic Gates. Sum of Products (Review) Procedure: 1.Form a minterm for each combination of the variables that produces a 1 2.OR all the minterms.
Solving Systems of Equations: Elimination Method.
1 Solid State Storage (SSS) System Error Recovery LHO 08 For NASA Langley Research Center.
June 10, Functionally Linear Decomposition and Synthesis of Logic Circuits for FPGAs Tomasz S. Czajkowski and Stephen D. Brown University of Toronto.
Toggle Equivalence Preserving (TEP) Logic Optimization Eugene Goldberg (Cadence), Kanupriya Gulati (Texas A&M University) Sunil Khatri (Texas A&M University)
Distributed computing using Projective Geometry: Decoding of Error correcting codes Nachiket Gajare, Hrishikesh Sharma and Prof. Sachin Patkar IIT Bombay.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View BDDs.
Background Motivation Implementation Conclusion 2.
Ajay K. Verma, Philip Brisk and Paolo Ienne Processor Architecture Laboratory (LAP) & Centre for Advanced Digital Systems (CSDA) Ecole Polytechnique Fédérale.
Weikang Qian. Outline Intersection Pattern and the Problem Motivation Solution 2.
On the Relation between SAT and BDDs for Equivalence Checking Sherief Reda Rolf Drechsler Alex Orailoglu Computer Science & Engineering Dept. University.
Linear Algebra Diyako Ghaderyan 1 Contents:  Linear Equations in Linear Algebra  Matrix Algebra  Determinants  Vector Spaces  Eigenvalues.
Curtis A. Nelson 1 Technology Mapping of Timed Circuits Curtis A. Nelson University of Utah September 23, 2002.
Binary-Decision-Diagram (BDD) Application on Pass-Transistor Logic Design Tao Lin School of EECS, Ohio University March 12, 1998.
A Decomposition Algorithm to Structure Arithmetic Circuits Ajay K. Verma, Philip Brisk, Paolo Ienne Ecole Polytechnique Fédérale de Lausanne (EPFL) International.
Arithmetic Test Pattern Generation: A Bit Level Formulation of the Optimization Problem S. Manich, L. García and J. Figueras.
2. Sissejuhatus teooriasse
Binary decision diagrams (BDD’s) Compact representation of a logic function ROBDD’s (reduced ordered BDD’s) are a canonical representation: equivalence.
click to start Example: A LINEAR TRANSFORMATION.
Linear Algebra Diyako Ghaderyan 1 Contents:  Linear Equations in Linear Algebra  Matrix Algebra  Determinants  Vector Spaces  Eigenvalues.
2/1/20001 ECE 551: Digital System Design & Synthesis Lecture Set 7 7.1: Coding for if and case 7.2: Coding logic building blocks (In separate file) 7.3:
BDS – A BDD Based Logic Optimization System Presented by Nitin Prakash (ECE 667, Spring 2011)
Chapter 8 Systems of Linear Equations in Two Variables Section 8.3.
Controlled- Controlled NOTControlled- Controlled NOT = Toffoli Gate.
2009/6/30 CAV Quantifier Elimination via Functional Composition Jie-Hong Roland Jiang Dept. of Electrical Eng. / Grad. Inst. of Electronics Eng.
Ajay K. Verma, Philip Brisk and Paolo Ienne Processor Architecture Laboratory (LAP) & Centre for Advanced Digital Systems (CSDA) Ecole Polytechnique Fédérale.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
BDD-based Synthesis of Reversible Logic for Large Functions Robert Wille Rolf Drechsler DAC’09 Presenter: Meng-yen Li.
Figure 1.1 A silicon wafer. Figure 1.1 A silicon wafer.
Abstraction and Refinement for Large Scale Model Checking
A New Logic Synthesis, ExorBDS
Digital Decode & Correction Logic
ECE 667 Synthesis and Verification of Digital Systems
ECE 667 Synthesis and Verification of Digital Systems
UNIT 5. Linear Systems with Random Inputs
Linear simultaneous Equations: Eliminating the variable
Spectral Approach to Verifying Nonlinear Arithmetic Circuits
Canonical Computation without Canonical Data Structure
Indicator 16 System of Equations.
Presentation transcript:

Abstract To present a novel logic synthesis method to reduce the area of XOR-based logic functions. Idea: To exploit linear dependency between logic sub- functions to create an implementation based on an XOR relationship with a lower area overhead.

Over View Introduction Background Decomposition and Synthesis Variable Partitioning Basic/ Selector Optimization Multi-Output Synthesis Experiment Results Related Work Conclusion and Future Work

Introduction The XOR-based logic functions are an important type of functions, heavily used in arithmetic, error correcting and telecommunication circuits. Focus on XOR-based logic functions and show that they exhibit a property that can be exploited for area reduction in this work.

XOR Decomposition (early work) Spectral decomposition Linear decomposition Davio expansion + help of BDDs (Reed-Muller logic equation) Look for x-dominators in a BDD that indicate a presennce of an XOR gate Tabular methods based on AC decomposition

FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.

FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.

FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.

FLDS Look at a linear relationship between logic functions Define functional linearity to be a decomposition of the form: f ( X ) = Σ i g i ( Y ) h i ( X-Y ) where X and Y are sets of variables (Y is the subset of X), while the summation represents an XOR gate.

Background Galois Field of characteristic 2 (GF(2)) Linear independence Vectors spaces Gaussion Elimination

Field

Galois Field of characteristic 2 (GF(2))

Linear independence

Gaussion Elimination

Decomposition and Synthesis

Variable Partitioning

Basic/ Selector Optimization

Multi-Output Synthesis

Experiment Results

Related Work

Conclusion and Future Work