EE 466/586 VLSI Design Partha Pande School of EECS Washington State University

Slides:



Advertisements
Similar presentations
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.
Advertisements

1 Lecture 16 Timing  Terminology  Timing issues  Asynchronous inputs.
Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
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.
1 Introduction Sequential circuit –Output depends not just on present inputs (as in combinational circuit), but on past sequence of inputs Stores bits,
Introduction to Sequential Logic Design Latches. 2 Terminology A bistable memory device is the generic term for the elements we are studying. Latches.
Introduction to CMOS VLSI Design Sequential Circuits
ECE C03 Lecture 81 Lecture 8 Memory Elements and Clocking Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Latches CS370 –Spring 2003 Section 4-2 Mano & Kime.
Modern VLSI Design 4e: Chapter 5 Copyright  2008 Wayne Wolf Topics n Memory elements. n Basics of sequential machines.
ELEC 256 / Saif Zahir UBC / 2000 Timing Methodology Overview Set of rules for interconnecting components and clocks When followed, guarantee proper operation.
Lecture 11: Sequential Circuit Design. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 11: Sequential Circuits2 Outline  Sequencing  Sequencing Element Design.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 24: November 4, 2011 Synchronous Circuits.
ECE 331 – Digital System Design Latches and Flip-Flops (Lecture #17) The slides included herein were taken from the materials accompanying Fundamentals.
1 Kuliah Rangkaian Digital Kuliah 8: Rangkaian Logika Sekuensial Teknik Komputer Universitas Gunadarma.
Digital Logic Design Lecture # 17 University of Tehran.
Introduction to Sequential Logic Design Bistable elements Latches.
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,
1 EE121 John Wakerly Lecture #8 Sequential Circuits Flip-flops Sequential PALs.
Digital Logic Design Lecture 22. Announcements Homework 7 due today Homework 8 on course webpage, due 11/20. Recitation quiz on Monday on material from.
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.
Introduction to CMOS VLSI Design Lecture 19: Design for Skew David Harris Harvey Mudd College Spring 2004.
Sequential Logic 1 clock data in may changestable data out (Q) stable Registers  Sample data using clock  Hold data between clock cycles  Computation.
Introduction to CMOS VLSI Design Clock Skew-tolerant circuits.
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.
EE141 © Digital Integrated Circuits 2nd Timing Issues 1 Latch-based Design.
CSE 140L Lecture 4 Flip-Flops, Shifters and Counters Professor CK Cheng CSE Dept. UC San Diego.
Lecture 9 Memory Elements and Clocking
Sequential Logic 1  Combinational logic:  Compute a function all at one time  Fast/expensive  e.g. combinational multiplier  Sequential logic:  Compute.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Memory elements. n Basics of sequential machines.
11/15/2004EE 42 fall 2004 lecture 321 Lecture #32 Registers, counters etc. Last lecture: –Digital circuits with feedback –Clocks –Flip-Flops This Lecture:
Chapter #6: Sequential Logic Design 6.2 Timing Methodologies
مرتضي صاحب الزماني  The registers are master-slave flip-flops (a.k.a. edge-triggered) –At the beginning of each cycle, propagate values from primary inputs.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #10 Latches, Flip Flops & Sequential PALS.
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.
Digital System Clocking: High-Performance and Low-Power Aspects Vojin G. Oklobdzija, Vladimir M. Stojanovic, Dejan M. Markovic, Nikola M. Nedovic Wiley-Interscience.
Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.
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.
EEE2243 Digital System Design Chapter 7: Advanced Design Considerations by Muhazam Mustapha, extracted from Intel Training Slides, April 2012.
Digital System Clocking: High-Performance and Low-Power Aspects Vojin G. Oklobdzija, Vladimir M. Stojanovic, Dejan M. Markovic, Nikola M. Nedovic Wiley-Interscience.
RTL Hardware Design by P. Chu Chapter Overview on sequential circuits 2. Synchronous circuits 3. Danger of synthesizing asynchronous circuit 4.
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.
Computer Architecture Lecture 4 Sequential Circuits Ralph Grishman September 2015 NYU.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 26: October 31, 2014 Synchronous Circuits.
Introduction to Sequential Logic Design Bistable elements.
June 2005Computer Architecture, Background and MotivationSlide 1 Part I Background and Motivation.
1 Performance Analysis (Clock Signal). 2 Unbalanced delays Logic with unbalanced delays leads to inefficient use of logic: long clock periodshort clock.
Lecture 11: FPGA-Based System Design October 18, 2004 ECE 697F Reconfigurable Computing Lecture 11 FPGA-Based System Design.
ECE C03 Lecture 81 Lecture 8 Memory Elements and Clocking Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
CEC 220 Digital Circuit Design Latches and Flip-Flops Monday, March 03 CEC 220 Digital Circuit Design Slide 1 of 19.
Sequential Logic Computer Organization II 1 © McQuain A clock is a free-running signal with a cycle time. A clock may be either high or.
Sequential Networks: Timing and Retiming
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
1 COMP541 Sequential Logic Timing Montek Singh Sep 30, 2015.
12006 MAPLD International ConferenceSpaceWire 101 Seminar Data Strobe (DS) Encoding Sam Stratton 2006 MAPLD International Conference.
Clocking System Design
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 20: October 25, 2010 Pass Transistors.
Topics Performance analysis..
Performance Analysis (Clock Signal) مرتضي صاحب الزماني.
Topics Clocking disciplines. Flip-flops. Latches..
Presentation transcript:

EE 466/586 VLSI Design Partha Pande School of EECS Washington State University

Two-Phase Systems Lecture 20

Clocking disciplines n Rules for constructing sequential machines. –Combinations of registers and gates. –Behavior of clocks and primary inputs over time. n Rules are sufficient to guarantee that the system will work at some clock rate. –May not be as fast as we want.

Clocking Rules n Combinational logic gates cannot be connected in a cycle n All components must have bounded delay

Flip-flop rules Primary inputs change after clock (  ) edge. n Primary inputs must stabilize before next clock edge. n Rules allow changes to propagate through combinational logic for next cycle. n Flip-flop outputs hold current-state values for next-state computation.

Signals in flip-flop system positive clock edge

Latch-based machines n Latches do not cut combinational logic when clock is active. n Latch-based machines must use multiple ranks of latches. n Multiple ranks require multiple phases of clock.

Two-sided latch constraint n Latch must be open less than the shortest combinational delay. n Period between latching operations must be longer than the longest combinational delay. n Note: difference between shortest and longest combinational delay may be large (sum 0 vs. sum 31 ).

Strict two-phase clocking discipline n Strict two-phase discipline is conservative but works. n Can be relaxed later with proper knowledge of constraints. n Strict two-phase machine makes latch-based machine behave more like flip-flop design, but requires multiple phases.

Strict two-phase architecture

Two-phase clock Phases must not overlap: non-overlap region

Why it works n Each phase has a one-sided constraint: phase must be long enough for all combinational delays. n If there are no combinational loops, phases can always be stretched to make that section of the machine work. n Total clock period depends on sum of phase periods.

Clocking types n Logic on different phases operate at different times—can’t mix signals from different phases. n Primary inputs must obey the same rules as internal signals. n Clocking types help us to ensure that machine structure is valid.

Stable signals n A logic signal is always stable during one phase—phase in which the latch which produced it is not active. n Easiest to think of machine behavior in terms of stable signals, though signals propagate while not stable.

Signal types Clocks are separate type:  1,  2. n Two types of stable data signal: –stable  1 (s  1 ) –stable  2 (s  2 ) n A stable signal has a complementary valid signal: –stable  2 (s  2 ) = valid  1 (v  1 )

Stable data signal inactive clock stable until latch feeding this logic goes active stable  2 becomes valid at end of  1

How clocking types combine

Clocking types in the two-phase machine combinational logic DQ combinational logic DQ I 1 (s  2 ) 11 O 1 (s  2 ) I 2 (s  1 ) O 2 (s  1 ) s  1 s  2 22

Example: shift register n Want to displace bit by n registers in n cycles. n Each register requires two phases:

Shift register operation  1 = 1,  2 = 0  1 = 0,  2 = 1

Non-strict disciplines n Some relaxation of the rules can be useful: –reduce area; –increase performance. n Rules must be relaxed in a way that ensures the machine will still work.

Qualified clocks n Use logic to generate a clock signal which is not always active. n Qualification must not introduce glitches into the clock—glitches violate the fundamental definition of a clock by introducing extra edges. n Use stable signals to qualify clocks.

Qualified clock n Clock logically combined with signal: DQ  sig1

Uses of qualified clocks n May want to conditionally load a register. n May qualify a clock to turn off machine for low-power operation. n Latch must not lose its value during inactive period. n Difficult to ensure that logic value will come high in time—use quasi-static latch.

Qualified clocks and skew n Logic in the clocking path introduces delay. n Delay can cause clock to arrive at latches at different times, violating clocking assumptions. n When designing qualification logic: –minimize and check skew; –sharpen clock edge.

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

Flip-flop-based system performance analysis

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

Clock parameters

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

Clock with rise/fall

Rise/fall clock period constraint n P >= C + s + p + t r. s p C trtr

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

Latch-based system model

Two-phase timing parameters

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

Latch-based system model

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:

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

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

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

Clock skew example

Clock skew in system DQDQ logic 

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