Topics Performance analysis..

Slides:



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

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.
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.
Introduction to CMOS VLSI Design Sequential Circuits
Lecture 11: Sequential Circuit Design. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 11: Sequential Circuits2 Outline  Sequencing  Sequencing Element Design.
FPGA-Based System Design: Chapter 5 Copyright  2004 Prentice Hall PTR Clocking disciplines Flip-flops. Latches.
K-Maps, Timing Sequential Circuits: Latches & Flip-Flops Lecture 4 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier,
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 17 - Sequential.
1 Lecture 28 Timing Analysis. 2 Overview °Circuits do not respond instantaneously to input changes °Predictable delay in transferring inputs to outputs.
Sequential Logic 1 clock data in may changestable data out (Q) stable Registers  Sample data using clock  Hold data between clock cycles  Computation.
1 Digital Design: State Machines Timing Behavior Credits : Slides adapted from: J.F. Wakerly, Digital Design, 4/e, Prentice Hall, 2006 C.H. Roth, Fundamentals.
Assume array size is 256 (mult: 4ns, add: 2ns)
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.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Sequential machine implementation: –clocking. n Sequential machine design.
Sequential Logic 1  Combinational logic:  Compute a function all at one time  Fast/expensive  e.g. combinational multiplier  Sequential logic:  Compute.
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.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Memory elements. n Basics of sequential machines.
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.
1 CSE370, Lecture 16 Lecture 19 u Logistics n HW5 is due today (full credit today, 20% off Monday 10:29am, Solutions up Monday 10:30am) n HW6 is due Wednesday.
Lecture 5. Sequential Logic 3 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
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.
1 Performance Analysis (Clock Signal). 2 Unbalanced delays Logic with unbalanced delays leads to inefficient use of logic: long clock periodshort clock.
Sequential Networks: Timing and Retiming
June clock data Q-flop Flop dataQ clock Flip-flop is edge triggered. It transfers input data to Q on clock rising edge. Memory Elements.
1 COMP541 Sequential Logic Timing Montek Singh Sep 30, 2015.
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
DIGITAL LOGIC CIRCUITS 조수경 DIGITAL LOGIC CIRCUITS.
Digital Design - Sequential Logic Design
Computer Architecture & Operations I
Lecture 11: Sequential Circuit Design
CSE 140 – Discussion 7 Nima Mousavi.
Chapter #6: Sequential Logic Design
Flip Flops Lecture 10 CAP
Sequential circuit design with metastability
Timing issues.
Learning Outcome By the end of this chapter, students are expected to refresh their knowledge on sequential logic related to HDL.
Appendix B The Basics of Logic Design
Basic Delay in Gates Definitions
6. Sequential circuits (v2)
DR S. & S.S. GHANDHY ENGINEENRING COLLEGE
CSE 140 MT 2 Review By Daniel Knapp.
Introduction to Sequential Logic Design
Latches and Flip-flops
CPE/EE 422/522 Advanced Logic Design L03
CS Fall 2005 – Lec. #5 – Sequential Logic - 1
CSE 370 – Winter Sequential Logic-2 - 1
COMP541 Flip-Flop Timing Montek Singh Feb 23, 2010.
Introduction to Static Timing Analysis:
Timing Analysis 11/21/2018.
触发器 Flip-Flops 刘鹏 浙江大学信息与电子工程学院 March 27, 2018
Clocking in High-Performance and Low-Power Systems Presentation given at: EPFL Lausanne, Switzerland June 23th, 2003 Vojin G. Oklobdzija Advanced.
ECE 434 Advanced Digital System L05
ECE434a Advanced Digital Systems L06
Performance Analysis (Clock Signal) مرتضي صاحب الزماني.
332:578 Deep Submicron VLSI Design Lecture 14 Design for Clock Skew
CSE 370 – Winter Sequential Logic-2 - 1
Topics Clocking disciplines. Flip-flops. Latches..
Pipeline Principle A non-pipelined system of combination circuits (A, B, C) that computation requires total of 300 picoseconds. Comb. logic.
ECE 352 Digital System Fundamentals
COMP541 Sequential Logic Timing
Lecture 19 Logistics Last lecture Today
Timing Analysis and Optimization of Sequential Circuits
SEQUENTIAL CIRCUITS __________________________________________________
Lecture 3: Timing & Sequential Circuits
Presentation transcript:

Topics Performance analysis.

Unbalanced delays Logic with unbalanced delays leads to inefficient use of logic: short clock period long clock period

Flip-flop-based system performance analysis

Flip-flop-based system model Clock signal is perfect (no rise/fall), period P. Clock event on rising edge. Setup time s. Time from arrival of combinational logic event to clock event. Propagation time p. Time for value to go from flip-flop input to output. Worst-case combinational delay C. Time from output of flip-flop to input.

Clock parameters

Clock period constraint P >= C + s + p. s C

Clock with rise/fall

Rise/fall clock period constraint P >= C + s + p + tr. s tr C

Min-max delays Delays may vary: Min/max delays compound over paths. Manufacturing variations. Temperature variations. Min/max delays compound over paths. Delays within a chip are correlated. t

Latch system clock period For each phase, phase period must be longer than sum of: combinational delay; latch propagation delay. Phase period depends on longest path.

Latch-based system model

Two-phase timing parameters

Clock period constraint Total clock period (both phases): P >= C1 + C2 + 2s + 2p. Each phase must meet timing for its own latch.

Latch-based system model

Advanced performance analysis Latch-based systems always have some idle logic. Can increase performance by blurring phase boundaries. Results in cycle time closer to average of phases.

Example with unbalanced phases One phase is much longer than the other:

Spreading out a phase Compute only part of long paths in one phase:

Spreading out a phase, cont’d. Use other phase for end of long logic block and all of short logic block:

Problems Hard to debug—can’t stop the system. Hard to initialize system state. More sensitive to process variations.

Timing and glitches in FSMs If inputs don’t change, can outputs glitch? logic input output D Q

Skew Skew: relative delay between events. Signal skew: most important for asynchronous, timing-dependent logic. Clock skew: can harm any sequential system.

Signal skew Machine data signals must obey setup and hold times—avoid signal skew.

Signal skew example

Clock skew Clock must arrive at all memory elements in time to load data.

Clock skew example

Clock skew in system D Q logic d D Q

Clock skew and qualified clocks

Clock skew analysis model s21 = d2 – d1 s12 = d1 – d2

Skew and clock period Assume that each flip-flop operates instantaneously: T >= D2 + d12 If clock arrives at FF2 after FF1, then we have more time to compute. Given clock period, determine allowable skew: s12 >= T + D2

Timing through logic As skew increases, we have less time to get the signal through the logic.

Clock distribution Often one of the hardest problems in clock design. Fast edges. Minimum skew.

Clock skew example D Q D Q 10 ps 10 ps 20 ps 20 ps 30 ps 30 ps

Retiming Retiming moves registers through combinational logic:

Retiming properties Retiming changes encoding of values in registers, but proper values can be reconstructed with combinational logic. Retiming may increase number of registers required. Retiming must preserve number of registers around a cycle—may not be possible with reconvergent fanout.