2002/10/08 SeonPil Kim Layout-Driven Synthesis For Submicron Technology : Mapping Expansions To Regular Lattices High Level Synthesis Homework #2.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Three Special Functions
Based on text by S. Mourad "Priciples of Electronic Systems" Digital Testing: Design Representation and Fault Detection
MVI Function Review Input X is p -valued variable. Each Input can have Value in Set {0, 1, 2,..., p i-1 } literal over X corresponds to subset of values.
Boolean Algebra and Combinational Logic
ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.
ECE 331 – Digital System Design
GF(4) Based Synthesis of Quaternary Reversible/Quantum Logic Circuits
LAYOUTDRIVEN SYNTHESIS FOR SUBMICRON TECHNOLOGY MAPPING EXPANSIONS TO REGULAR LATTICES Woong Hwangbo.
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
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.
Chapter 3 Simplification of Switching Functions
Multi-Valued Input Two-Valued Output Functions. Multi-Valued Input Slide 2 Example Automobile features 0123 X1X1 TransManAuto X2Doors234 X3ColourSilverRedBlackBlue.
Lattice Diagrams using Reed-Muller Logic Shim, Hee Jun.
Regular Structures. Levelized Structures Standard Lattice Diagrams for continuous, multiple-valued and binary logic.
Homework Your task is to design a regular structure such as Kronecker Lattice or Shannon Lattice using modern Quantum Dot Cellular Automata technology.
ECE Synthesis & Verification - Lecture 10 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems Binary.
ECE 667 Synthesis and Verification of Digital Systems
Fast Spectral Transforms and Logic Synthesis DoRon Motter August 2, 2001.
Chapter 2: Boolean Algebra and Logic Functions
BOOLEAN FUNCTION PROPERTIES
Combinational Logic Design
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Digital Logic Chapter 4 Presented by Prof Tim Johnson
طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
B-1 Appendix B - Reduction of Digital Logic Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles.
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
Department of Computer Engineering
1 The Chinese University of Hong Kong Faculty of Education Diploma in Education (Part-Time) Winter 1997 Educational Communications and Technology Assignment.
1 © 2015 B. Wilkinson Modification date: January 1, 2015 Designing combinational circuits Logic circuits whose outputs are dependent upon the values placed.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Copyright © 2004 by Miguel A. Marin1 COMBINATIONAL CIRCUIT SYNTHESIS CLASSIC TWO-LEVEL CIRCUIT SYNTHESIS MULTILEVEL-CIRCUIT SYNTHESIS FACTORIZATION DECOMPOSITION.
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
Digital Systems: Combinational Logic Circuits Wen-Hung Liao, Ph.D.
UM EECS 270 Spring 2011 – Taken from Dr.Karem Sakallah Logic Synthesis: From Specs to Circuits Implementation Styles –Random –Regular Optimization Criteria.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Mathematical Preliminaries
Lecture 3. Combinational Logic 1 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
Module –I Switching Function
Fundamentals of digital electronics Prepared by - Anuradha Tandon Assistant Professor, Instrumentation & Control Engineering Branch, IT, NU.
Chapter 3 Special Section Focus on Karnaugh Maps.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
CLASSICAL LOGIC SRFPGA layout With I/O pins.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
Boolean Functions 1 ECE 667 ECE 667 Synthesis and Verification of Digital Circuits Boolean Functions Basics Maciej Ciesielski Univ.
Standard & Canonical Forms COE 202 Digital Logic Design Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum.
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
1 EENG 2710 Chapter 3 Simplification of Switching Functions.
©2010 Cengage Learning SLIDES FOR CHAPTER 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use.
UNIT 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
BDD-based Synthesis of Reversible Logic for Large Functions Robert Wille Rolf Drechsler DAC’09 Presenter: Meng-yen Li.
Computer Science 210 Computer Organization
Chapter 2: Boolean Algebra and Logic Functions
ECE 2110: Introduction to Digital Systems
Computer Organisation
ECE 3110: Introduction to Digital Systems
ECE 667 Synthesis and Verification of Digital Systems
BASIC & COMBINATIONAL LOGIC CIRCUIT
CSE140 HW2 Preparation Xinyuan Wang 04/20/2018.
Instructor: Alexander Stoytchev
Dr. Clincy Professor of CS
A logic function f in n inputs x1, x2, ...xn and
A logic function f in n inputs x1, x2, ...xn and
ECE 352 Digital System Fundamentals
Presentation transcript:

2002/10/08 SeonPil Kim Layout-Driven Synthesis For Submicron Technology : Mapping Expansions To Regular Lattices High Level Synthesis Homework #2

Components of Paper 1. Expansion of Function creates several successor nodes of this node. Functions f corresponds to the initial node in the lattice, initially a tree. 2. Joining (Reverse Expansion) joins several nodes of a bottom of the lattice. This is in a sense a reverse operation to expansion. 3. Regular Geometry to which the nodes are mapped, this geometry guides which nodes of the level are to be joined. 4. Process of Lattice Creation 5. Conclusion

Expansion - introduction o What is Expansion? l The fundament of out approach l Expansion is operators that transform a function to few simpler function. o Classification of Expansion l In Uniqueness n Canonical (such as Shannon Expansion) n Non-Canonical (such as SOP Expansion) l In Implement type n Maximum type – Generalization of Shannon, Post (Multi-Valued Shannon), SOP Expansions n Linear Independent type – Generalization of Davio expansions ( This Expansion is usually for arbitrary algebra that have at least one Linear Operation)

Expansion – nodes of Shannon and pD,nD (a)(b) (c)(d) Figure 1. Figure 1. present different expansion nodes for various kinds of expansions Figure 1-(a) : shows two views of a cell for Shannon (S) Expansion. Figure 1-(b) : shows the positive Davio (pD) and the negative Davio (nD) Figure 1-(c) : shows Shannon node for 3-valued logic. Figure 1-(d) : shows node for 4-valued logic.

Expansion – nodes of SOP o SOP Expansion l In Binary SOP expansions a branching from node f is for any subset of literals li that their union covers the node function f. l Trees, diagrams, lattices based on SOP (binary and MV) expansion are not ordered and not canonical. Figure 2. SOP

Expansion – cofactor o Cofactors l Each binary function f is represented by pair fa = [ ON(fa), OFF(fa) ] l Every Cofactor fa for the product a of an (in)complete function f can be interpreted as intersecting f with a and replacing all K-map cells outside product a with don’t cares. o Standard Cofactor l A standard cofactor fx whew x is variable does not depend on this variable. l Standard cofactors are in general not disjoint o Vacuous Cofactor ( v-factor ) l fx is still a function of all variable including x, but as a result of cofactoring the variable x becomes vacuous.

Joining – v-cofactor case o Vacuous cofactor Expansion l For any two disjoint products a1 and a2, the v-cofactor fa1 and ga2 are disjoint. l Then, fa1 and ga2 are in incomplete tautology relation. -> functions f and g are not changed when fa1 and ga2 are joined (OR-ed) to create a new function : l This way ENTIRE lattice is created level-by-level. l Functions in lattice nodes become more and more unspecified when variables in levels are repeated. Figure 3. Expansion and Joining (a) Shannon (b) Ternary Post

Joining– not v-cofactor case o When g and h is not disjoint l g2 node and h0 node are combined to a new node ag2 XOR h0 l Correction Term ah0 and ag2 are propagated to left and right, respectably. Figure 2.Creation of a Positive Davio level in a Regular Diagram: (a) two expanded node before reverse expansion, (b) layer of regular diagram after reverse expansion of node g2 and h0 (this expansion is based on EXOR-base)

Joining – about cofactor o Every variable cuts a K-map into two disjoint parts. o Thus,arbitrary two functions f and g can always be expanded together to a Shannon Lattice with OR-ing as a join operation. l The same variable xi is used in the same level. l All expansions use negated literal in the left and positive literal of the variable in left o This process can increase the number of nodes in comparison with a shared OBDD of these functions. But a regular structure is created, thus simplifying layout and making delay predictable. o When fa1 and ga2 is not disjoint, new functions in levels are created by rearranging the cofactor in joinings. But when fa1 and ga2 is disjoint, there is no need to rearrange the f and g functions. In other words, fa1 and ga2 is OR-ing without changing f and g.

Regular Geometry – Galois Field o Galois Field l Galois Field is based on Algebra of Finite Field that has finite elements. l Digital logic is in GF(2) because all values of signal in logic are in two values 0,1. l For Multi-valued logic, it is needed to have truth table of all operations that are used in logic completely. Figure 5-2. GF(4) Multiplication operation Figure 5-1. GF(4) Add operation

Regular Geometry o Symmetry It can be shown in professor’s paper, every function that is not symmetric can be symmetrized by repeating variables in the lattice layers. So Non-symmetric function will not be cared. o In case of 4 Neighbors l Input :North and East (GF(2)) l Output:South and West Figure. Regular Lattice for 4 Neighbors

Regular Geometry o In case of 6 Neighbors l Inputs: (N,NE and E) GF(3) l Outputs: (W,SW and S) o In case of 8 Neighbors l Inputs: (N,NE, NW and E) GF(4) l Outputs: (W,SW, SE and S) Figure. Regular Lattice for 6 Neighbors Figure. Regular Lattice for 8 Neighbors

Process of Lattice Creation o EXAMPLE l 2X2 Regular LAYOUT Geometries n In case of 4 neighbors, 2X2 cells, the lattice is planar and it is based on a rectangular grid. n Cell has two inputs and two outputs. n The structure generalize the known Switch realization of symmetric binary functions, based on Shannon expansion n The same structure for Positive and Negative Davio expansions, negated variables and constants as control variables of the nodes. n Theorem Every non-symmetric function can be symmetrized by repeating variables. l 3X3 Regular LAYOUT Geometries n Three Inputs ( N,NE,E) and three outputs (W,SW,S) n Generalized ternary diagrams for binary EXOR. n Arbitrary expansion-based Post Logic n GF(3)

Conclusion o Starting from all possible neighbor geometries in two and three dimensional spaces, we create all possible regular structures. o This extends previous planar geometries. o Next we design arbitrary expansions for any of the structures. o New expansion can be constructed based on the Linearly Independent function theory, or any other canonical or non-canonical function expansions. o There exist a very high number of various new expansions. o This LAYOUT-driven synthesis approaches are created for various function. o This approach generalizes and unifies many known expansions, decision diagrams, and regular layout geometries.