1 / 45

Lecture 10: Sequential Networks: Timing and Retiming

Lecture 10: Sequential Networks: Timing and Retiming CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego. Timing. Two timing constraints: Shortest and longest timing paths

brianfreeman
Télécharger la présentation

Lecture 10: Sequential Networks: Timing and Retiming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 10: Sequential Networks: Timing and Retiming CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego

  2. Timing • Two timing constraints: Shortest and longest timing paths • Flip-Flop timing window • Combinational timing

  3. Timing • Clock specifies a precise time for the next state • In general, we allocate one clock period for signal propagation between registers. • Too late: Fail to reach for the setup of the next state. • Too early: Race to disturb the holding of the next state. • Analysis: Verify the timing of the system. • Goal: A robust design.

  4. So far …. Combinational CLK Logic-level analysis

  5. This lecture … Combinational CLK • When does our (seemingly logically correct) design go wrong? • How can we design a circuit that works under real constraints?

  6. Sequential Networks R1 Combinational R2 D B C A CLK1 CLK2 A typical sequential network has combinational circuit between registers (R1 to R2). The registers are synchronized by clocks (CLK1 to CLK2). Timing is set between clocks (CLK1 and CLK2). The beauty of the synchronized design is that we need only to take care of the timing of the regions separated by the registers.

  7. iClicker • For a synchronized digital Moore machine, we need to take care of the timing of the following region(s). • Between every pair of registers. • Between i. input and register, and ii. register and output. • Both A and B. • Whole system from input to output including registers. x(t) C1 C2 y(t) CLK S(t)

  8. Combinational B C A CLK1 CLK2 tcq + tcomb + tsetup ≤ T thold< tcq + tcomb

  9. Combinational B C A CLK1 CLK2 Setup time constraint tcq + tcomb + tsetup ≤ T Longest delay from CLK1 to CLK2 max(tcq + tcomb + tsetup )≤ T Hold time constraint thold< tcq + tcomb Shortest delay from CLK1 to CLK2 thold< min(tcq + tcomb)

  10. Sequential Networks Timing: Setup Time and Hold Time Constraints Q Q’ D

  11. Timing Constraints of flip flops D t1 time What if the input transition happens late, close to the rising edge? • Output will still be one at t1 • Output will be zero at t1 • Can’t say for sure Q Q’ D

  12. Input Constraints: Set up and hold time • Setup time: tsetup • Time before the clock edge that data must be stable (i.e. not change) • Hold time: thold • Time after the clock edge that data must be stable Q Q’ D Aperture time: ta Time around clock edge that data must be stable (ta = tsetup + thold)

  13. Set up and hold time violations • Setup time violation This occurs if the input data signal does not remain unchanged for at least tsetupbefore the clock edge. • Hold time violation This occurs if the input data signal does not remain unchanged for at least tsetupbefore the clock edge Q Q’ D

  14. Output Timing Constraints • Propagation delay: tpcq = time after clock edge that the output Q is guaranteed to be stable (i.e., to stop changing) • Contamination delay: tccq = time after clock edge that Q might be unstable (i.e., start changing) Q Q’ D

  15. Output Timing Constraints • Contamination delay: tccq Time after clock edge that Q might be unstable (i.e., start changing) • Propagation delay: tpcq Time after clock edge that the output Q is guaranteed to be stable (i.e., to stop changing) Q Q’ D

  16. PIQ: A hold time violation is likely to occur when • The input signal (into the flip flop) fails to change to a desired value fast enough • The output signal (out of the flip flop) takes too long to stabilize • The input signal (into the flip flop) does not remain stable long enough after the clock edge • The output signal (out of the flip flop) changes too quickly

  17. PIQ: The timing of which of the following signals can cause a setup-time violation? Q Q’ T Q(t) T(t) • The input signal T(t) • The output signal Q(t) • The clock signal, CLK • Some of the above • None of the above CLK

  18. PIQ: For a given flip-flop implementation which of its timing parameters can we modify when designing a sequential network (depicted below) Combinational • Set up and hold time • Propagation and Contamination delays • All of the above • None of the above CLK

  19. Fact 1: Once a flip flop has been ‘built’ we are stuck with its timing characteristics: tsetup , thold,tccq,tpcq Combinational Now let’s look at the timing characteristics of the combinational part CLK

  20. Combinational Logic: Output timing constraints Combinational circuit X1 Y1 X2 Y2 X3 Y3 X4 Y4 • Why don’t we have input constraints?

  21. Combinational Logic: Output timing constraints Combinational circuit X1 Y1 X2 Y2 X3 Y3 X4 Y4 • Contamination delay: tcd Minimum time from when an input changes until any output starts to change

  22. Combinational Logic: Output timing constraints Combinational circuit X1 Y1 X2 Y2 X3 Y3 X4 Y4 • Contamination delay: tcd Minimum time from when an input changes until any output starts to change • Propagation delay: tpd Maximum time from when an input changes until the output or outputs of a combinational circuit are guaranteed to reach their final value (i.e., stop changing)

  23. Combinational Logic: Output timing constraints A B Y C D PI Q: Which path in the above circuit determines the contamination delay of the circuit (assuming the delay of all the gates is the same)? • AND- OR – NOR • AND-OR • NOR • OR-NOR

  24. Combinational Logic: Output timing constraints A B Y C D PI Q: Which path in the above circuit determines the propagation delay of the circuit (assuming the delay of all the gates is the same)? • AND- OR – NOR • AND-OR • NOR • OR-NOR

  25. An alternate view of the sequential circuit Combinational Combinational R1 R2 Q1 D2 D1 CLK CLK CLK

  26. What should happen within a clock cycle for correct functionality? Combinational R1 R2 Q1 D2 D1 CLK CLK

  27. The delay between registers has a minimum and maximum delay, dependent on the delays of the circuit elements (Dynamic Discipline)

  28. PI Q: Suppose input to R1 changed before t1, what is the maximum delay (from t1) after which D2 reaches a stable value? • Setup time of R1+ Propagation delay of CL + Propagation delay of R2 • Hold time of R1+ Propagation delay of CL + setup time of R1 • Propagation delay of R1+ Propagation delay of CL + Propagation delay of R2 • Propagation delay of R1+ Propagation delay of CL • Propagation delay of CL + Propagation delay of R2

  29. 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 tsetup before the clock edge. Maximum delay, tmax = Setup Time Constraint:

  30. Setup Time Constraint Tc ≥ tpcq + tpd + tsetup PI Q: As a designer, which of the following parameters would you modify to meet the set up time constraint? The clock period, Tc The prop. delay of R1, tpcq The prop. delay of CL, tpd The setup time of R2, tsetup All of the above

  31. Setup Time Constraint Tc ≥ tpcq + tpd + tsetup tpd ≤ Tc – (tpcq + tsetup) PI Q: As a designer, which of the following parameters would you modify to meet the set up time constraint? The clock period, Tc The prop. delay of R1, tpcq The prop. delay of CL, tpd The setup time of R2, tsetup All of the above

  32. PI Q: Suppose input to R1 changed before t1, what is the minimum delay (from t1) after which D2 starts to change? • Setup time of R1+ propagation delay of CL + propagation of R2 • Hold time of R1+ propagation time of CL +setup time of R1 • Hold time of R1+ Contamination delay of CL + Propagation time of R2 • Contamination delay of R1+ Contamination delay of CL • Contamination delay of CL + Contamination delay of R2

  33. 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 thold after the clock edge. Minimum delay, tmin = Hold Time Constraint:

  34. Hold Time Constraint thold < tccq + tcd tcd > thold - tccq

  35. Timing Analysis Timing Characteristics tccq = 30 ps tpcq = 50 ps tsetup = 60 ps thold = 70 ps tpd = 35 ps tcd = 25 ps tpd = tcd = Setup time constraint: Tc≥ fc = 1/Tc = Hold time constraint: tccq + tpd > thold ?

  36. Timing Analysis Timing Characteristics tccq = 30 ps tpcq = 50 ps tsetup = 60 ps thold = 70 ps tpd = 35 ps tcd = 25 ps tpd = 3 x 35 ps = 105 ps tcd = 25 ps Setup time constraint: Tc≥ (50 + 105 + 60) ps = 215 ps fc = 1/Tc = 4.65 GHz Hold time constraint: tccq + tcd > thold ? (30 + 25) ps > 70 ps ? No!

  37. Fixing Hold Time Violation Timing Characteristics tccq = 30 ps tpcq = 50 ps tsetup = 60 ps thold = 70 ps tpd = 35 ps tcd = 25 ps Add buffers to the short paths: tpd = tcd = Setup time constraint: Tc≥ fc = Hold time constraint: tccq + tpd > thold ?

  38. Fixing Hold Time Violation Timing Characteristics tccq = 30 ps tpcq = 50 ps tsetup = 60 ps thold = 70 ps tpd = 35 ps tcd = 25 ps Add buffers to the short paths: tpd = 3 x 35 ps = 105 ps tcd = 2 x 25 ps = 50 ps Setup time constraint: Tc≥ (50 + 105 + 60) ps = 215 ps fc = 1/Tc = 4.65 GHz Hold time constraint: tccq + tcd > thold ? (30 + 50) ps > 70 ps ? Yes!

  39. Clock Skew • The clock doesn’t arrive at all registers at the same time • Skew is the difference between two clock edges • Examine the worst case to guarantee that the dynamic discipline is not violated for any register – many registers in a system!

  40. Setup Time Constraint with Clock Skew Tc ≥ tpcq + tpd + tsetup + tskew tpd ≤ Tc – (tpcq + tsetup + tskew) • In the worst case, the CLK2 is earlier than CLK1

  41. Timing Analysis with clock skew Timing Characteristics tccq = 30 ps tpcq = 50 ps tsetup = 60 ps thold = 70 ps tpd = 35 ps tcd = 25 ps tskew = 50 ps tpd = 3 x 35 ps = 105 ps tcd = 25 ps Setup time constraint: Tc≥ 265 ps fc = 1/Tc =3.77 GHz Without skew we got fc =4.65 GHz

  42. Hold Time Constraint with Clock Skew • In the worst case, CLK2 is later than CLK1 tccq + tcd > thold + tskew tcd > thold + tskew – tccq

  43. Hold Time Violation Timing Characteristics tccq = 30 ps tpcq = 50 ps tsetup = 60 ps thold = 70 ps tpd = 35 ps tcd = 25 ps tskew = 50 ps Add buffers to the short paths: tpd = 3 x 35 ps = 105 ps tcd = 2 x 25 ps = 50 ps Hold time constraint: tccq + tcd > thold + tskew? (30 + 50) ps > (70 ps +50) ps ?

  44. Timing and Retiming • Retiming: Adjust the clock skew so that the clock period can be reduced. • Add a few more examples on timing and retiming.

  45. Conclusion • Clock to Clock: Range of shortest and longest paths • Design revision and retiming to adjust the constraints • Research: Variation aware designs

More Related