Prof. Shiyan Hu Shiyan@mtu.edu Gate Sizing Prof. Shiyan Hu Shiyan@mtu.edu.

Slides:



Advertisements
Similar presentations
April 2004NUCAD Northwestern University1 Minimal Period Retiming Under Process Variations Jia Wang and Hai Zhou Electrical & Computer Engineering Northwestern.
Advertisements

Design and Implementation of VLSI Systems (EN1600)
DC Circuit Analysis HRW P639>. Circuit Symbols Resistor Voltage source (battery) Switch Wire (Conductor)
Advanced Interconnect Optimizations. Buffers Improve Slack RAT = 300 Delay = 350 Slack = -50 RAT = 700 Delay = 600 Slack = 100 RAT = 300 Delay = 250 Slack.
4/22/ Clock Network Synthesis Prof. Shiyan Hu Office: EREC 731.
ELEN 468 Lecture 261 ELEN 468 Advanced Logic Design Lecture 26 Interconnect Timing Optimization.
Confidentiality/date line: 13pt Arial Regular, white Maximum length: 1 line Information separated by vertical strokes, with two spaces on either side Disclaimer.
Kazi Spring 2008CSCI 6601 CSCI-660 Introduction to VLSI Design Khurram Kazi.
S. Reda EN1600 SP’08 Design and Implementation of VLSI Systems (EN1600S08) Lecture12: Logical Effort (1/2) Prof. Sherief Reda Division of Engineering,
Modern VLSI Design 2e: Chapter4 Copyright  1998 Prentice Hall PTR.
EE4271 VLSI Design Interconnect Optimizations Buffer Insertion.
Interconnect Optimizations. A scaling primer Ideal process scaling: –Device geometries shrink by S  = 0.7x) Device delay shrinks by s –Wire geometries.
Interconnect Optimizations
Global Routing Prof. Shiyan Hu Office: EERC 731.
Outline Noise Margins Transient Analysis Delay Estimation
S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture10: Delay Estimation Prof. Sherief Reda Division of Engineering, Brown University.
Parallel Circuit electricity has more than one path to follow total amps are equal to the sum of the individual amps total watts are equal to the sum of.
1 MICROELETTRONICA Logical Effort and delay Lection 4.
Gate Sizing by Mathematical Programming Prof. Shiyan Hu
CMOS VLSI For Computer Engineering Lecture 4 – Logical Effort Prof. Luke Theogarajan parts adapted form Harris – and Rabaey-
7/15/ VLSI Placement Prof. Shiyan Hu Office: EERC 731.
Lecture 9, Slide 1EECS40, Fall 2004Prof. White Lecture #9 OUTLINE –Transient response of 1 st -order circuits –Application: modeling of digital logic gate.
EET Survey of Electronics Chapter 13 - Parallel Circuits.
EGRE 427 Advanced Digital Design Figures from Application-Specific Integrated Circuits, Michael John Sebastian Smith, Addison Wesley, 1997 Chapter 3 ASIC.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n Circuit design for FPGAs: –Logic elements. –Interconnect.
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Static Timing Analysis and Gate Sizing.
Introduction  Chip designers face a bewildering array of choices –What is the best circuit topology for a function? –How many stages of logic give least.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Combinational network delay. n Logic optimization.
ECO Timing Optimization Using Spare Cells Yen-Pin Chen, Jia-Wei Fang, and Yao-Wen Chang ICCAD2007, Pages ICCAD2007, Pages
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 7: September 22, 2010 Delay and RC Response.
Fast Algorithms for Slew Constrained Minimum Cost Buffering S. Hu*, C. Alpert**, J. Hu*, S. Karandikar**, Z. Li*, W. Shi* and C. Sze** *Dept of ECE, Texas.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Circuit design for FPGAs n Static CMOS gate vs. LUT n LE output drivers n Interconnect.
EE 4271 VLSI Design, Fall 2013 Static Timing Analysis and Gate Sizing Optimization.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Combinational network delay. n Logic optimization.
A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion Shiyan Hu*, Zhuo Li**, Charles Alpert** *Dept of Electrical.
Potential – Learning Outcomes  Draw and discuss a potential divider.  Demonstrate a potential divider.  Discuss potentiometers and their use in variable.
1 Timing Closure and the constant delay paradigm Problem: (timing closure problem) It has been difficult to get a circuit that meets delay requirements.
Physics Section 18.2 Apply series and parallel circuits. Note: A simple circuit may contain only one load. A more complex circuit may contain numerous.
Intro to Electricity Electricity Definition: Circuit Definition: Three things for a circuit to work:
Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 8: September 21, 2012 Delay and RC Response.
COE 360 Principles of VLSI Design Delay. 2 Definitions.
Copyright © 2004 The McGraw-Hill Companies, Inc. All rights reserved.
POWER ELECTRONICS & ITS APPLICATION
Static Timing Analysis and Gate Sizing Optimization
Crosstalk If both a wire and its neighbor are switching at the same time, the direction of the switching affects the amount of charge to be delivered and.
Topics Driving long wires..
Prof. Vojin G. Oklobdzija
Basic Electrical Circuits
Static Timing Analysis and Gate Sizing Optimization
Lecture 6: Logical Effort
Topics Circuit design for FPGAs: Logic elements. Interconnect.
Logical Effort Basics from Bart Zeydel.
Day 17: October 8, 2014 Performance: Gates
EE5780 Advanced VLSI Computer-Aided Design
Lecture 6: Logical Effort
Lecture 20: Combinatorial Circuits I
Inductance Screening and Inductance Matrix Sparsification
Introduction to CMOS VLSI Design Lecture 5: Logical Effort
Estimating Delays Would be nice to have a “back of the envelope” method for sizing gates for speed Logical Effort Book by Sutherland, Sproull, Harris Chapter.
Wire Indctance Consequences of on-chip inductance include:
Lecture 6: Logical Effort
Day 17: October 9, 2013 Performance: Gates
Day 8: September 23, 2011 Delay and RC Response
5.4 T-joins and Postman Problems
Day 16: October 12, 2012 Performance: Gates
Day 16: October 17, 2011 Performance: Gates
Advanced Logical Effort
Basic Electrical Circuits
NP Completeness of Discrete Wire Sizing
Presentation transcript:

Prof. Shiyan Hu Shiyan@mtu.edu Gate Sizing Prof. Shiyan Hu Shiyan@mtu.edu

Problem Definition Given a timing (delay) target, use smallest power/area gates to meet the timing target In general, smaller power -> larger timing, smaller timing -> larger power.

Delay due to Gate Sizing Suppose that unit width gate capacitance is c and unit width gate resistance is r. Given gate size wi, Gate size wi: R  r/wi, C  cwi Delay is a function of RC Delay   RiCj   wi/wj

Wire and Gate Models

Combinatorial Circuit Model Gate size variables x1, x2, x3 Delay on each gate depends on x a1 x1 a3 a6 D1 D4 D6 D7 a5 a7 a2 a4 Drivers D2 Loads D9 D10 D3 D5 D8 x3 x2

Path Delay Express path delay in terms of component delay A component can be a gate or a wire Delay D for each component Arrival time a for some components

Gate Sizing Power/area minimization under delay constraints: This can be solved efficiently using gpsolve

Gate Sizing using GPSOLVE Follow the steps in gatesizing.m for the example in the slides of timing analysis and optimization