Node Optimization. Simplification Represent each node in two level form Use espresso to minimize each node Several simplification procedures which vary.

Slides:

Advertisements

Similar presentations

Date of Birth Design Problem

Advertisements

Techniques for Combinational Logic Optimization

Boolean Algebra Variables: only 2 values (0,1)

Inside the binary adder. Electro-mechanical relay A solid state relay is a switch that is controlled by a current. When current flows from A to B, the.

Escola Politécnica da Universidade de São Paulo GSEIS - LME Logic Synthesis in IC Design and Associated Tools Sequential Synthesis Wang Jiang Chau Grupo.

SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Microsoft Research.

Magnetic Data Storage A computer hard drive stores your data magnetically Disk NS direction of disk motion Write Head __ Bits of information.

Magnets used to store data ? Magnet with unknown state Current N S S N 0 1.

Logic Gate Objects This document contains various images created by Andrew C. M. Rodger, 4 October Tools used:LibreOffice Impress 3 Microsoft Powerpoint.

Pulse Code Modulation Pulse Code Modulation

Recursion and Induction

Princess Sumaya University

Introduction to CAFE Yu Hen Hu September 25, 2000.

COE 202: Digital Logic Design Sequential Circuits Part 2

Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.

Lab02 :Logic Gate Fundamentals:

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,

Announcements mid-term on Thursday 12:30 – be on time. Calculators allowed (required!) No assignment due this week Assignment 6 posted on Thursday Project.

Logic Gates. Transistors as Switches ¡V BB voltage controls whether the transistor conducts in a common base configuration. ¡Logic circuits can be built.

Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Digital Logic.

Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR

CS 151 Digital Systems Design Lecture 5 Boolean Algebra.

CHAPTER 2 LOGIC GATES.

Boolean Algebra and Logic Gates

(CSC 102) Discrete Structures Lecture 5.

©2010 Akula LLC, Jeremy R. Hertzberg, BS CMPE Computer Technology Transistor to computer gates

Logic Circuits Situations to explain states What is a logic Gate

Logic Gates & Circuits. AND Gate Input AInput BOutput X AND Logic Gate AND Truth Table X = A. B AND Boolean Expression.

Chapter3: Gate-Level Minimization Part 2

Chapter 3 Digital Logic Structures

topics Logic gates Gates types Universal gates

Cache and Virtual Memory Replacement Algorithms

A New Recombination Lower Bound and The Minimum Perfect Phylogenetic Forest Problem Yufeng Wu and Dan Gusfield UC Davis COCOON07 July 16, 2007.

01 Introduction to Digital Logic

Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Exploiting Don’t Cares in Logic Minimization.

Verilog Section 3.10 Section 4.5. Keywords Keywords are predefined lowercase identifiers that define the language constructs – Key example of keywords:

Functional Notation Addendum to Chapter 4. 2 Logic Notation Systems  We have seen three different, but equally powerful, notational methods for describing.

CS 121 Digital Logic Design

CS 121 Digital Logic Design

CS 121 Digital Logic Design

Karnaugh Maps ECEn/CS 224.

Complexity Classes: P and NP

CS 121 Digital Logic Design

Princess Sumaya University

Combinational Circuits

Digital Logic & Design Lecture No. 3. Number System Conversion Conversion between binary and octal can be carried out by inspection.  Each octal digit.

Address comments to FPGA Area Reduction by Multi-Output Sequential Resynthesis Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1.

Finite-state Recognizers

Group 5 – Maria Bozzi, Brian Surber, Sifat Syed and Can Gurkan.

CS1104 – Computer Organization

ELECTRONICS TECHNOLOGY Digital Devices I Karnaugh Maps

Digital Logic Design Lecture 13. Announcements HW5 up on course webpage. Due on Tuesday, 10/21 in class. Upcoming: Exam on October 28. Will cover material.

Synthesis For Finite State Machines. FSM (Finite State Machine) Optimization State tables State minimization State assignment Combinational logic optimization.

Finite State Machines Finite state machines with output

Optimization of Sequential Networks Step in Synthesis: Problem Flow Table Reduce States Minimum-State Table State Assignment Circuit Transition Table Flip-Flop.

Min terms and logic expression

1 EECS 219B Spring 2001 Node minimization Andreas Kuehlmann.

FUNCTION OPTIMIZATION Switching Function Representations can be Classified in Terms of Levels Number of Levels, k, is Number of Unique Boolean (binary)

ENGG3190 Logic Synthesis “Multi Level Logic” (Part II) Winter 2014 S. Areibi School of Engineering University of Guelph.

ENGIN112 L9: More Karnaugh Maps September 22, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 9 More Karnaugh Maps and Don’t Cares.

Lab 4 Design a processor to implement the Fibonacci sequence

Multilevel Logic Minimization -- Introduction. ENEE 6442 Outline > Multi-level minimization: technology independent local optimization. > What to optimize:

ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.

Boolean Methods for Multi-level Logic Synthesis Giovanni De Micheli Integrated Systems Centre EPF Lausanne This presentation can be used for non-commercial.

CHAPTER 1 : INTRODUCTION

Boolean Algebra.

CSE 370 – Winter 2002 – Logic minimization - 1

Robert Brayton UC Berkeley

Presentation transcript:

Node Optimization

Simplification Represent each node in two level form Use espresso to minimize each node Several simplification procedures which vary only in the size of don’t care constructed –don’t care set empty –subset of don’t care

Simplification Don’t Care –External DC –Internal DC (derived from the structure) (1) Satisfiability DC (SDC) (2) Observability DC (ODC)

Satisfiability Don’t Care Satisfiability DC (to all nodes) Ex: x = ab y = a’b’ f = x’y’+a x ab = x(ab)’+x’(ab) Why? Expand the Boolean space of PI to include intermediate variables B n B n+ m n=2 m= b a x In general, SDC = (y i f i ’ + y i ’ f i )

Observability Don’t Care Observability DC ( to certain intermediate node) f is sensitive to the value of x ( )’ f is not sensitive to the value of x x is observable at f if 0 (Note is a function of the inputs)

Example Ex: u = ab+xc’+x’b’ x = a’b+ac’ = u x u x’ + u x ’ u x’ ’ u x = ab + c’ u x’ = ab + b’ = u x u x’ + u x ’ u x’ ’ = (ab+c’b’) + a’bc (the ODC of x) u = ab+xc’+x’b’ x=a’b+ac’ abc   u x ( )’   u x (

Observability Don’t Care ODC relative to x is ODC x = f i output Including the external DC ( + D xi ) f i output In general, the complete DC is too large solutions: filter the DC => subset “support” filter

Incompleteness of Don’t Cares Example COMPARATOR ADDER B A  x 2 x 1 x 0 N2N2 N1N1  a 1 a 0 b 1 b 0  z 1 z 0 Z = 0 1  a + b < 3 Z = 0 0  a + b = 3 Z = 1 0  a + b > 3

Equivalence x 2 x 1 x 0 z 1 z Input values 000, 001, and 010 are equivalent {000,001,010} forms an equivalence class. The other equivalent classes are: {011} and {100,101,110,111} with respect to B.

Boolean Relation Formulation If x', x'' are input values indistinguishable from the outputs of B, they are interchangeable output values for A. a 1 a 0 b 1 b 0 x 2 x 1 x {000,001,010} {000,001,010} {000,001,010} {000,001,010} {000,001,010} {011} {000,001,010} {011} {011} {100,101,110,111} {011} {100,101,110,111} {100,101,110,111} {100,101,110,111} {100,101,110,111} {100,101,110,111}

Example The optimal implementation of the following a b x y , , aa aa bb bb relation R  B 2  B 2

Problems 1. How to find a multiple-output sub-network ? 2. How to utilize Boolean Relations for minimization ? – full set of Boolean Relation – subset of Boolean Relation