Lecture 5. Sequential Logic 3 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.

Slides:



Advertisements
Similar presentations
CS 140 Lecture 11 Sequential Networks: Timing and Retiming Professor CK Cheng CSE Dept. UC San Diego 1.
Advertisements

1 A latch is a pair of cross-coupled inverters –They can be NAND or NOR gates as shown –Consider their behavior (each step is one gate delay in time) –From.
Tutorial 2 Sequential Logic. Registers A register is basically a D Flip-Flop A D Flip Flop has 3 basic ports. D, Q, and Clock.
1 Lecture 16 Timing  Terminology  Timing issues  Asynchronous inputs.
Synchronous Sequential Logic
1 COMP541 Flip-Flop Timing Montek Singh Oct 6, 2014.
Modern VLSI Design 4e: Chapter 5 Copyright  2008 Wayne Wolf Topics n Performance analysis of sequential machines.
Introduction to CMOS VLSI Design Sequential Circuits.
VLSI Design EE 447/547 Sequential circuits 1 EE 447/547 VLSI Design Lecture 9: Sequential Circuits.
Introduction to CMOS VLSI Design Sequential Circuits
S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 24: Sequential Circuit Design (2/3) Prof. Sherief Reda Division of Engineering,
MICROELETTRONICA Sequential circuits Lection 7.
Lecture 11: Sequential Circuit Design. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 11: Sequential Circuits2 Outline  Sequencing  Sequencing Element Design.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /23/2013 Lecture 7: Computer Clock & Memory Elements Instructor: Ashraf Yaseen DEPARTMENT OF MATH &
Digital Logic Design Lecture # 17 University of Tehran.
K-Maps, Timing Sequential Circuits: Latches & Flip-Flops Lecture 4 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier,
1 Lecture 28 Timing Analysis. 2 Overview °Circuits do not respond instantaneously to input changes °Predictable delay in transferring inputs to outputs.
Z. Feng MTU EE4800 CMOS Digital IC Design & Analysis EE4800 CMOS Digital IC Design & Analysis Lecture 11 Sequential Circuit Design Zhuo Feng.
Sequential Logic 1 clock data in may changestable data out (Q) stable Registers  Sample data using clock  Hold data between clock cycles  Computation.
Assume array size is 256 (mult: 4ns, add: 2ns)
How Computers Work Lecture 6 Page 1 How Computers Work Lecture 6 Finite State Machines.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
ENGIN112 L28: Timing Analysis November 7, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 28 Timing Analysis.
Give qualifications of instructors: DAP
CSE 140L Lecture 4 Flip-Flops, Shifters and Counters Professor CK Cheng CSE Dept. UC San Diego.
Sequential Logic 1  Combinational logic:  Compute a function all at one time  Fast/expensive  e.g. combinational multiplier  Sequential logic:  Compute.
Embedded Systems Hardware:
Timing in Sequential circuits – Stabilization time of a latch Assume that: t hl,1 = t lh,1 = t hl,2 = t lh,2 = 1 time unit 1 2.
S. Reda EN160 SP’08 Design and Implementation of VLSI Systems (EN1600) Lecture 22: Sequential Circuit Design (1/2) Prof. Sherief Reda Division of Engineering,
Design and Implementation of VLSI Systems (EN1600) Lecture 23: Sequential Circuit Design (2/2) Prof. Sherief Reda Division of Engineering, Brown University.
Embedded Systems Hardware: Storage Elements; Finite State Machines; Sequential Logic.
Introduction to CMOS VLSI Design Lecture 10: Sequential Circuits
Chapter #6: Sequential Logic Design 6.2 Timing Methodologies
Introduction to CMOS VLSI Design Lecture 10: Sequential Circuits Credits: David Harris Harvey Mudd College (Material taken/adapted from Harris’ lecture.
CS 151 Digital Systems Design Lecture 28 Timing Analysis.
CS3350B Computer Architecture Winter 2015 Lecture 5.2: State Circuits: Circuits that Remember Marc Moreno Maza [Adapted.
Lecture 9. MIPS Processor Design – Instruction Fetch Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education &
1 CSE370, Lecture 17 Lecture 17 u Logistics n Lab 7 this week n HW6 is due Friday n Office Hours íMine: Friday 10:00-11:00 as usual íSara: Thursday 2:30-3:20.
Copyright © 2007 Elsevier3- Ders-6: Ardışıl Mantık Devreleri Tasarımı.
Computer Architecture Lecture 4 Sequential Circuits Ralph Grishman September 2015 NYU.
Lecture 5. Sequential Logic 2 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
1 COMP541 Sequential Circuits Montek Singh Feb 1, 2007.
CEC 220 Digital Circuit Design Latches and Flip-Flops Monday, March 03 CEC 220 Digital Circuit Design Slide 1 of 19.
Sequential Networks: Timing and Retiming
Chapter 3 Computer System Architectures Based on
Copyright © 2007 Elsevier3- Sequential Logic Circuits Design.
Lecture 5. Sequential Logic 1 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
1 COMP541 Sequential Logic Timing Montek Singh Sep 30, 2015.
Clocking System Design
CS 61C: Great Ideas in Computer Architecture Sequential Elements, Synchronous Digital Systems 1 Instructors: Vladimir Stojanovic & Nicholas Weaver
CS 110 Computer Architecture Lecture 9: Finite State Machines, Functional Units Instructor: Sören Schwertfeger School of.
Lecture 4. Sequential Logic #3 Prof. Taeweon Suh Computer Science & Engineering Korea University COSE221, COMP211 Logic Design.
Computer Science 210 Computer Organization
Lecture 4. Sequential Logic #1
Computer Architecture & Operations I
Chapter 3 Digital Design and Computer Architecture, 2nd Edition
Chapter 3 Digital Design and Computer Architecture: ARM® Edition
Lecture 4. Sequential Logic #2
Flip Flops Lecture 10 CAP
Timing and Verification
Sequential circuit design with metastability
Computer Architecture & Operations I
Computer Science 210 Computer Organization
Computer Science 210 Computer Organization
COMP541 Flip-Flop Timing Montek Singh Feb 23, 2010.
Introduction to Static Timing Analysis:
Lecture 14: Performance Optimization
COMP541 Sequential Logic Timing
Lecture 19 Logistics Last lecture Today
Instructor: Michael Greenbaum
Presentation transcript:

Lecture 5. Sequential Logic 3 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research

Korea Univ What Determines Clock Speed? What is the operating clock frequency of your computer?  Why does the atom processor on your netbook run at 1.4GHz?  Why does the Core 2 Duo on your notebook run at 2.0GHz?  Why can’t run at 100GHz or 1000GHz?  We are going to answer to this question today 2

Korea Univ Synchronous Sequential Circuit As studied, virtually all the synchronous sequential circuits (including CPU) are composed of  Flip-flops cascaded  Combinational logic between flip-flops Pipeline is also implemented in this way We are going to talk deep about this in computer architecture class next semester 3 R1 R2 R3 Q2D2D3 D1 CL1 CL2 Q3

Korea Univ Short Answer Suppose that the circuit does addition (+1) to the input (D1)  CL1 does “+1”  So, we want to get “D1+1” after 1 clock cycle 4 R1 R2 Q2 D2 D1 CL1 CL1 delay If delay is longer than 1ns, the circuit can’t run at 1GHzIf delay is shorter than 1ns, the circuit can run at 1GHz

Korea Univ A Little Long Answer Let’s talk a little deep about what contributes to the delay Consequently what determines the clock frequency of synchronous sequential circuit 5

Korea Univ Timing Flip-flop samples D at the (rising) edge of the clock Input data in D must be stable when it is sampled  Similar to a photograph, input data must be stable around the clock edge  If input data is changing when it is sampled, metastability can occur 6

Korea Univ Input Timing Constraints Setup time  t setup = time before the clock edge that data must be stable Hold time  t hold = time after the clock edge that data must be stable Aperture time  t a = time around clock edge that data must be stable (t setup + t hold ) 7

Korea Univ Output Timing of Flip-Flop Propagation delay  t pcq = time after clock edge that the output Q is guaranteed to be stable (i.e., to stop changing) Contamination delay  t ccq = time after clock edge that Q might be unstable (i.e., start changing) Output timing is determined depending on how you implement flip- flop 8

Korea Univ Dynamic Discipline The input to a synchronous sequential circuit must be stable during the aperture (setup and hold) time around the clock edge. Specifically, the input must be stable  at least t setup before the clock edge  at least until t hold after the clock edge 9

Korea Univ Dynamic Discipline The delay between registers has a minimum and maximum delay, dependent on the delays of the circuit elements 10

Korea Univ Setup Time Constraint The setup time constraint depends on the maximum delay from register R1 through the combinational logic The input to register R2 must be stable at least t setup before the clock edge 11 T c ≥ t pcq + t pd + t setup t pd ≤ T c – (t pcq + t setup )

Korea Univ Hold Time Constraint The hold time constraint depends on the minimum delay from register R1 through the combinational logic The input to register R2 must be stable for at least t hold after the clock edge 12 t ccq + t cd > t hold t cd > t hold - t ccq

Korea Univ Timing Analysis Example 13 Timing Characteristics t ccq = 30 ps t pcq = 50 ps t setup = 60 ps t hold = 70 ps t pd = 35 ps t cd = 25 ps

Korea Univ Timing Analysis Example 14 Setup time constraint: t pd = 3 x 35 ps = 105 ps T c ≥ ( ) ps = 215 ps f c = 1/T c = 4.65 GHz Hold time constraint: t ccq + t cd > t hold ? ( ) ps > 70 ps ? No! Timing Characteristics t ccq = 30 ps t pcq = 50 ps t setup = 60 ps t hold = 70 ps t pd = 35 ps t cd = 25 ps T c ≥ t pcq + t pd + t setup t ccq + t cd > t hold

Korea Univ Fixing Hold Time Violation 15 Add buffers to the short paths: Setup time constraint: t pd = 3 x 35 ps = 105 ps T c ≥ ( ) ps = 215 ps f c = 1/T c = 4.65 GHz T c ≥ t pcq + t pd + t setup Timing Characteristics t ccq = 30 ps t pcq = 50 ps t setup = 60 ps t hold = 70 ps t pd = 35 ps t cd = 25 ps t ccq + t cd > t hold Hold time constraint: t ccq + t cd > t hold ? ( ) ps > 70 ps ? Yes!