Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Standard cell-based layout. n Channel routing. n Simulation.

Slides:



Advertisements
Similar presentations
Modern VLSI Design 3e: Chapter 3 Copyright 1998, 2002 Prentice Hall PTR Topics n Combinational logic functions. n Static complementary logic gate structures.
Advertisements

Topics Electrical properties of static combinational gates:
Cambridge University Engineering Department VLSI Design Third Year Standard Project - SB1 Second Mini Lecture Web page: 12th.
Overview Why VLSI? Moore’s Law. The VLSI design process.
ALU Organization Michael Vong Louis Young Rongli Zhu Dan.
Ch.7 Layout Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.
Modern VLSI Design 3e: Chapter 10 Copyright  2002 Prentice Hall Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture 24: CAD Systems &
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 11 - Combinational.
Cambridge University Engineering Department VLSI Design Third Year Standard Project - SB1 Second Mini Lecture Web page: 12th.
Modern VLSI Design 2e: Chapter4 Copyright  1998 Prentice Hall PTR.
Spring 07, Jan 16 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Introduction Vishwani D. Agrawal James J. Danaher.
Graphic Tool for Computer Chip Layout Laura McLane Saint Michael’s College Advisor: Joanna Ellis-Monaghan.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 21: April 15, 2009 Routing 1.
VLSI Routing. Routing Problem  Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect.
Physical Design Outline –What is Physical Design –Design Methods –Design Styles –Analysis and Verification Goal –Understand physical design topics Reading.
Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 19: April 9, 2008 Routing 1.
Fuzzy Evolutionary Algorithm for VLSI Placement Sadiq M. SaitHabib YoussefJunaid A. Khan Department of Computer Engineering King Fahd University of Petroleum.
1 8 Bit ALU EE 166 Design Project San Jose State University Roger Flores Brian Silva Chris Tran Harizo Yawary Advisor: Dr. Parent May 2006.
Computer ArchitectureFall 2008 © August 20 th, Introduction to Computer Architecture Lecture 2 – Digital Logic Design.
Multi-Layer Channel Routing Complexity and Algorithm Rajat K. Pal.
CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Crosstalk. n Power optimization.
7/13/ EE4271 VLSI Design VLSI Routing. 2 7/13/2015 Routing Problem Routing to reduce the area.
Modern VLSI Design 4e: Chapter 3 Copyright  2008 Wayne Wolf Topics n Combinational logic functions. n Static complementary logic gate structures.
CSET 4650 Field Programmable Logic Devices
9/4/ VLSI Physical Design Automation Prof. David Pan Office: ACES Detailed Routing (I)
EGRE 427 Advanced Digital Design Figures from Application-Specific Integrated Circuits, Michael John Sebastian Smith, Addison Wesley, 1997 Chapter 7 Programmable.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
Introduction to VLSI Design – Lec01. Chapter 1 Introduction to VLSI Design Lecture # 2 A Circuit Design Example.
Global Routing.
CAD for Physical Design of VLSI Circuits
Open Discussion of Design Flow Today’s task: Design an ASIC that will drive a TV cell phone Exercise objective: Importance of codesign.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Switch networks. n Combinational testing.
Modern VLSI Design 4e: Chapter 8 Copyright  2008 Wayne Wolf Topics Testability and architecture. Design methodologies. Multiprocessor system-on-chip.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.
Modern VLSI Design 3e: Chapters 1-3 week12-1 Lecture 30 Scale and Yield Mar. 24, 2003.
Complementary CMOS Logic Style Construction (cont.) Digital Integrated Circuits© Prentice Hall 1995 Introduction.
Complementary CMOS Logic Style Construction (cont.)
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Combinational network delay. n Logic optimization.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
Modern VLSI Design 4e: Chapter 6 Copyright  2008 Wayne Wolf Topics n Shifters. n Adders and ALUs.
Modern VLSI Design 4e: Chapter 3 Copyright  2008 Wayne Wolf Topics n Pseudo-nMOS gates. n DCVS logic. n Domino gates. n Design-for-yield. n Gates as IP.
4. Combinational Logic Networks Layout Design Methods 4. 2
Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Topics n CAD systems. n Simulation. n Placement and routing. n Layout analysis.
Topics Design methodologies. Kitchen timer example.
VLSI Design Lecture 5: Logic Gates Mohammad Arjomand CE Department Sharif Univ. of Tech. Adapted with modifications from Wayne Wolf’s lecture notes.
Exercise TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 13: February 20, 2002 Routing 1.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 13: March 3, 2015 Routing 1.
Detailed Routing مرتضي صاحب الزماني.
1 Contents Reviewed Rabaey CH 3, 4, and 6. 2 Physical Structure of MOS Transistors: the NMOS [Adapted from Principles of CMOS VLSI Design by Weste & Eshraghian]
FPGA-Based System Design: Chapter 1 Copyright  2004 Prentice Hall PTR Moore’s Law n Gordon Moore: co-founder of Intel. n Predicted that number of transistors.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Combinational network delay. n Logic optimization.
EE4271 VLSI Design VLSI Channel Routing.
Cell Design Standard Cells Datapath Cells General purpose logic
CALTECH CS137 Fall DeHon 1 CS137: Electronic Design Automation Day 21: November 28, 2005 Routing 1.
ECE 565 VLSI Chip Design Styles
Layout of CMOS Circuits
VLSI Physical Design Automation
VLSI Testing Lecture 5: Logic Simulation
VLSI Testing Lecture 5: Logic Simulation
Computer Science 210 Computer Organization
We will be studying the architecture of XC3000.
ESE535: Electronic Design Automation
Review Lectures Mar. 31 – April Note:.
EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.
VLSI Physical Design Automation
Presentation transcript:

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Standard cell-based layout. n Channel routing. n Simulation.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Standard cell layout n Layout made of small cells: gates, flip- flops, etc. n Cells are hand-designed. n Assembly of cells is automatic: –cells arranged in rows; –wires routed between (and through) cells.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Standard cell structure VDD VSS n tub p tub Intra-cell wiring pullups pulldowns pin Feedthrough area

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Standard cell design n Pitch: height of cell. –All cells have same pitch, may have different widths. n VDD, VSS connections are designed to run through cells. n A feedthrough area may allow wires to be routed over the cell.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Single-row layout design Routing channel cell wireHorizontal track Vertical track height

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Routing channels n Tracks form a grid for routing. –Spacing between tracks is center-to-center distance between wires. –Track spacing depends on wire layer used. n Different layers are (generally) used for horizontal and vertical wires. –Horizontal and vertical can be routed relatively independently.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Routing channel design n Placement of cells determines placement of pins. n Pin placement determines difficulty of routing problem. n Density: lower bound on number of horizontal tracks needed to route the channel. –Maximum number of nets crossing from one end of channel to the other.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Pin placement and routing before abc bca abc bca Density = 3 Density = 2

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Example: full adder layout n Two outputs: sum, carry. sum carry x1 x2 n1 n2 n3 n4

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Layout methodology n Generate candidates, evaluate area and speed. –Can improve candidate without starting from scratch. n To generate a candidate: –place gates in a row; –draw wires between gates and primary inputs/outputs; –measure channel density.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf A candidate layout x1x2n1n2n3n4 a b c s cout Density = 5

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Improvement strategies n Swap pairs of gates. –Doesn’t help here. n Exchange larger groups of cells. –Swapping order of sum and carry groups doesn’t help either. n This seems to be the placement that gives the lowest channel density. –Cell sizes are fixed, so channel height determines area.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Left-edge algorithm n Basic channel routing algorithm. n Assumes one horizontal segment per net. n Sweep pins from left to right: –assign horizontal segment to lowest available track.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Example ABC ABBC

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Limitations of left-edge algorithm n Some combinations of nets require more than one horizontal segment per net. BA AB aligned ?

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Vertical constraints n Aligned pins form vertical constraints. –Wire to lower pin must be on lower track; wire to upper pin must be above lower pin’s wire. BA AB

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Dogleg wire n A dogleg wire has more than one horizontal segment. BA AB

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Rat’s nest plot n Can be used to judge placement before final routing.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Simulation n Goals of simulation: –functional verification; –timing; –power consumption; –testability.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Types of simulation n Circuit simulation: –analog voltages and currents. n Timing simulation: –simple analog models to provide timing but not detailed waveforms. n Switch simulation: –transistors as semi-ideal switches.

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Types of simulation, cont’d. n Gate simulation: –logic gates as primitive elements. n Models for gate simulation: –zero delay; –unit delay; –variable delay. n Fault simulation: –models fault propagation (more later).

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Example: switch simulation a + + b c d c X X X o 0 1 1

Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Example, cont’d. a + + b c d c o