Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Overview n Why VLSI? n Moore’s Law. n The VLSI design process. These lecture.

Slides:



Advertisements
Similar presentations
Overview Why VLSI? Moore’s Law. The VLSI design process.
Advertisements

Assembly Language for x86 Processors 6 th Edition Chapter 1: Introduction to ASM (c) Pearson Education, All rights reserved. You may modify and copy.
CMPT150, Ch 3, Tariq Nuruddin, Fall 06, SFU 1 Ch3. Combinatorial Logic Design Modern digital design involves a number of techniques and tools essential.
Lecture 1 Design Hierarchy Chapter 1. Digital System Design Flow 1.Register-Transfer Levl (RTL) – e.g. VHDL/Verilog 2.Gate Level Design 3.Circuit Level.
1 What this lecture is all about?  Introduction to digital integrated circuits.  CMOS devices and manufacturing technology. CMOS inverters and gates.
1 COMP541 Combinational Logic and Design Montek Singh Jan 25, 2007.
Chapter 1. Introduction This course is all about how computers work But what do we mean by a computer? –Different types: desktop, servers, embedded devices.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Memory elements. n Basics of sequential machines.
EE314 Basic EE II Silicon Technology [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]
Informationsteknologi Friday, October 19, 2007Computer Architecture I - Class 81 Today’s class Digital Logic.
VLSI System Design Pradondet Nilagupta Department of Computer Engineering Kasetsart University.
3.1Introduction to CPU Central processing unit etched on silicon chip called microprocessor Contain tens of millions of tiny transistors Key components:
Dept. of Communications and Tokyo Institute of Technology
Lecture 03: Fundamentals of Computer Design - Trends and Performance Kai Bu
Computer Architecture
Digitaalsüsteemide verifitseerimise kursus1 Digitaalsüsteemide verifitseerimine IAF0620, 5.0 AP, E Jaan Raik IT-208,
Very Large Scale Integrated chips (VLSI) The complexity of the digital computation chips is increasing in line with Moore’s law.The complexity of the digital.
FPGA based system design  Programmable logic.  FPGA Introduction  FPGA Architecture  Advantages & History of FPGA  FPGA-Based System Design  Goals.
1 EMT 251/4 INTRODUCTION TO IC DESIGN Mr. Muhammad Imran bin Ahmad Profesor N.S. Murthy.
Modern VLSI Design 3e: Chapter 3Partly from 2002 Prentice Hall PTR week9-1 Lectures 21, 22 FPGA and Top-Down Design Flow Mar. 3 and 5, 2003.
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
Overview Why VLSI? Moore’s Law. ASIC: Abstraction and Hierarchy.
COE 405 Design and Modeling of Digital Systems
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR FPGA Fabric n Elements of an FPGA fabric –Logic element –Placement –Wiring –I/O.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
Eng.Samra Essalaimeh Philadelphia University 2013/ nd Semester PIC Microcontrollers.
CPEN Digital System Design
FPGA-Based System Design: Chapter 1 Copyright  2004 Prentice Hall PTR Overview n Why VLSI? n Moore’s Law. n Why FPGAs? n The VLSI and system design process.
Chapter 0 deSiGn conCepTs EKT 221 / 4 DIGITAL ELECTRONICS II.
Topics Design methodologies. Kitchen timer example.
Fall 2004EE 3563 Digital Systems Design EE 3563 VHSIC Hardware Description Language  Required Reading: –These Slides –VHDL Tutorial  Very High Speed.
Computer Organization & Assembly Language © by DR. M. Amer.
Overview Why VLSI? Moore’s Law. Why FPGAs? Circuit Component
Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Overview n Why VLSI? n Moore’s Law. n The VLSI design process.
FPGA Based System Design
Topics Architecture of FPGA: Logic elements. Interconnect. Pins.
Morgan Kaufmann Publishers
Modern VLSI Design 3e: Chapter 7 Copyright  1998, 2002 Prentice Hall PTR Topics n Power/ground routing. n Clock routing. n Floorplanning tips. n Off-chip.
Lecture 1: Course Introduction September 8, 2004 ECE 697F Reconfigurable Computing Lecture 1 Course Introduction Prof. Russell Tessier.
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.
EE141 © Digital Integrated Circuits 2nd Introduction 1 Principle of CMOS VLSI Design Introduction Adapted from Digital Integrated, Copyright 2003 Prentice.
VLSI Design System-on-Chip Design
Main memory Processor Bus Cache memory Figure 1.5.The processor cache.
Integrated Microsystems Lab. EE372 VLSI SYSTEM DESIGNE. Yoon 1-1 Panorama of VLSI Design Fabrication (Chem, physics) Technology (EE) Systems (CS) Matel.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 22 Memory Definitions Memory ─ A collection of storage cells together with the necessary.
Systems Architecture, Fourth Edition 1 Processor Technology and Architecture Chapter 4.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
Computer Organization IS F242. Course Objective It aims at understanding and appreciating the computing system’s functional components, their characteristics,
Memory Interface EEE 365 [FALL 2014] LECTURER 12 ATANU K SAHA BRAC UNIVERSITY.
EE141 © Digital Integrated Circuits 2nd Introduction 1 EE4271 VLSI Design Dr. Shiyan Hu Office: EERC 731 Adapted and modified from Digital.
William Stallings Computer Organization and Architecture 6th Edition
Combinational Logic Design
VLSI Design Methodologies
Instructor:Po-Yu Kuo 教師:郭柏佑
CS140 Lecture 03: The Machinery of Computation: Combinational Logic
Architecture & Organization 1
Instructor: Alexander Stoytchev
Fundamentals of Computer Science Part i2
Architecture & Organization 1
Overview of VLSI 魏凱城 彰化師範大學資工系.
T Computer Architecture, Autumn 2005
3.1 Introduction to CPU Central processing unit etched on silicon chip called microprocessor Contain tens of millions of tiny transistors Key components:
Overview Why VLSI? Moore’s Law. Why FPGAs?
Instructor:Po-Yu Kuo 教師:郭柏佑
Chapter 1 Introduction.
HIGH LEVEL SYNTHESIS.
COMS 361 Computer Organization
1.Introduction to Advanced Digital Design (14 marks)
Overview Why VLSI? Moore’s Law. Why FPGAs?
Presentation transcript:

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Overview n Why VLSI? n Moore’s Law. n The VLSI design process. These lecture notes include my annotations, changes and additions. These annotations, changes, and additions marked in red are not in any way endorsed or approved by the author or publisher of the text, Modern VLSI Design/System-on-Chip Design. A. Yavuz Oruc, University of Maryland, College Park, MD 20742

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Why VLSI? n Integration improves the design and fabrication: –lower parasitics (capacitive charging, resistive dissipation) = higher speed; –lower power (smaller devices+ less heat dissipation at the interface); –physically smaller. n Integration reduces manufacturing cost-(almost) no manual assembly. n Integration also increases system reliability by reducing component interface and interconnections

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR VLSI and you n Microprocessors: –personal computers; –microcontrollers. –Hand-held devices-wireless phones, pdas,video cameras,etc… n DRAM/SRAM Memory chips n Special-purpose processors.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Moore’s Law n Gordon Moore: co-founder of Intel n Predicted that number of transistors per chip would grow exponentially (double every 18 months). n Exponential improvement in technology is a natural trend: steam engines, dynamos, automobiles.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Moore’s Law(Cont’d) n Q(n) = 2  Q(n-1.5) => n Q(n) = 2 k  Q(n-1.5k), n Q(0) = Q 0 (some initial value at some initial date) => k= n/1.5 and n Q(n) = Q 0  2 n/1.5 = Q 0  2 n/1.5 n = Q 0  (1.333) n n If we replace 1.5 by 1 we get a much steeper rise (2 n ). (Count doubles every year…)

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Moore’s Law(Cont’d)

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Moore’s Law(Cont’d) ftp://download.intel.com/museum/Moores_Law/Printed_Materials/Moores_Law_Backgrounder.pdf For a more complete list of intel processors and their features, see

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Moore’s Law(Cont’d)

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Moore’s Law plot Log # transistors This is a log plot--- Taking the log of the formula for Q(n) gives a linear relation between the years and log of number of transistors: Log Q(n) = Log Q 0 + n  Log (See slide 5)

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR The cost of fabrication n Current cost: $2-3 billion. n Typical fab line occupies about 1 city block, employs a few hundred people. n Most profitable period is first 18 months-2 years.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Cost factors in ICs n For large-volume ICs: –packaging is largest cost; –testing is second-largest cost. n For low-volume ICs, design costs may swamp all manufacturing costs.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR The VLSI design process n May be part of larger product design. n Major levels of abstraction: –specification; (describe functionality) –architecture; (describe functionality with building blocks) –logic design; (convert architecture to logic circuits) –circuit design; (convert logic logic circuits to transistor circuits) –layout. (lay out the transistor circuits in VLSI)

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Challenges in VLSI design n Multiple levels of abstraction: transistors to CPUs. n Multiple and conflicting constraints: low cost and high performance are often at odds. n Short design time: Late products are often irrelevant.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Dealing with complexity n Divide-and-conquer: limit the number of components you deal with at any one time. n Group several components into larger components: –transistors form gates; –gates form functional units; –functional units form processing elements; –etc.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Hierarchical name n Interior view of a component: –components and wires that make it up. n Exterior view of a component = type: –body; –pins. Full adder a b cin sum cout

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Instantiating component types n Each instance has its own name: –add1 (type full adder) –add2 (type full adder). n Each instance is a separate copy of the type: Add1(Full adder) a b cin sum cout Add2(Full adder) a b cin sum Add1.a Add2.a

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR z box1box2x A hierarchical logic design Incomplete--- not enough labels to specify the netlist and component list on the next slide (Component terminal counts do not appear to match either!)

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Net lists and component lists n Net list: (list of terminals in a net) net1: top.in1 in1.in net2: i1.out xxx.B topin1: top.n1 xxx.xin1 topin2: top.n2 xxx.xin2 botin1: top.n3 xxx.xin3 net3: xxx.out i2.in outnet: i2.out top.out n Component list (nets connected to each pin of a component): top: in1=net1 n1=topin1 n2=topin2 n3=topin3 out=outnet i1: in=net1 out=net2 xxx: xin1=topin1 xin2=topin2 xin3=botin1 B=net2 out=net3 i2: in=net3 out=outnet

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR A hierarchical logic design top ABC i2 o2 o1 Inserted & modified the labels i1 o1 o2 i1 i2 i1 o1 p qr s t i1o1 N

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Net lists and component lists Two-level net list: Level-1has 2 components, top and C, which appear on 6 nets: net11: top.p net12: top.q net13: top.r net14: top.s, C.i1 net15: top.t C.i2 net16: C.o1 Level-2 has 3 components: A, N and B, which appear on 7 nets net21: top.p, A.i1 net22: top.q, A.o2 net23: top.r, B.i2 net24: top.s, B.o1 net25: top.t, B.o2 net26: A.o1, N.i1 net27: B.i1, N.o1 Two-level component list Level-1 has 2 components, top and C and they are on the following nets: top = net11, net12, net13,net14,net15 C= net15, net16 Level-2 has 3 components, A, N, and B, and they are on the following nets A = net21, net22 B = net23, net24, net25 N = net26, net27

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Component hierarchy top i1xxxi2

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Hierarchical names n Typical hierarchical name: –top/i1.foo component pin

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Layout and its abstractions n Layout for dynamic latch: (Top view)

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Stick diagram

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Transistor schematic

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Mixed schematic inverter

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Levels of abstraction n Specification: function, cost, etc. n Architecture: large blocks. n Logic: gates + registers. n Circuits: transistor sizes for speed, power. n Layout: determines parasitics.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Circuit abstraction n Continuous voltages and time:

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Digital abstraction n Discrete levels, discrete time: = 2 Least significant bit

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Register-transfer abstraction n Abstract components, abstract data types:

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Top-down v.s. bottom-up design n Top-down design adds functional detail. –Create lower levels of abstraction from upper levels. n Bottom-up design creates abstractions from low-level behavior. n Good design needs both top-down and bottom-up efforts.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Design abstractions specification behavior register- transfer logic circuit layout English Executable program Sequential machines Logic gates transistors rectangles Throughput, design time Function units, clock cycles Literals, logic depth Nanoseconds power microns functioncost

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Design validation n Must check at every step that errors haven’t been introduced-the longer an error remains, the more expensive it becomes to remove it. n Forward checking: compare results of less- and more-abstract stages. n Back annotation: copy performance numbers to earlier stages.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Manufacturing test n Not the same as design validation: just because the design is right doesn’t mean that every chip coming off the line will be right. n Must quickly check whether manufacturing defects destroy function of chip. n Must also speed-grade.

Modern VLSI Design 3e: Chapter 1 Copyright  1998, 2002 Prentice Hall PTR Homework Set-1 (Due: September 19) Problem 1.1. At the Intel site, the clock speeds of intel family of microprocessors from 1971 to 2004 are listed. Use this list to fit the clock speeds of Intel microprocessors that were manufactured between 1971 and 2004 by a power function, i.e., determine the base b in f 0  b n, where f 0 is the clock speed in MHz in 1971 and n denotes a year between 1971 and if more than one processor is listed within a given month, use the clock speed of the fastest processor. Plot the actual clock speeds v.s. the power function you have derived. Problem 1.2. Give the net and component lists for the following circuit by clearly marking each of the nets and components. input-1 input-2 output VsVs VsVs VdVd A BC D