8. 3. Time borrowing
φ1
φ2
φ1 φ2 φ1
Latch
Latch
Latch
Combinational
(a) Combinational Logic
Logic
Borrowing time across Borrowing time across
half-cycle boundary pipeline stage boundary
φ1 φ2
Latch
Latch
Combinational
(b) Combinational Logic Logic
Loops may borrow time internally but must complete within the cycle
S. Reda EN160 SP’07
9. How much time can be borrowed?
φ1 φ2
D1 Q1 D2 Q2
Combinational Logic 1
L1
L2
φ1
φ2 tnonoverlap
Tc
tsetup
Tc/2 tborrow
Nominal Half-Cycle 1 Delay
D2
Tborrow <= Tc/2 –(tsetup + tnonoverlap)
S. Reda EN160 SP’07
10. 4. Clock Skew
• We have assumed zero clock skew
• Clocks really have uncertainty in arrival time
– Decreases maximum propagation delay
– Increases minimum contamination delay
– Decreases time borrowing
S. Reda EN160 SP’07