The setup check can be mathematically expressed as:
Tlaunch + Tck2q + Tdp < Tcapture + Tcycle - Tsetup
where Tlaunch is the delay of the clock tree of the launch flip-flop UFF0, Tdp is the delay of the combinational logic data path and Tcycle is the clock period.
Tcapture is the delay of the clock tree for the capture flip-flop UFF1.
Since the setup check poses a max constraint, the setup check always uses the longest or the max timing path. For the same reason, this check is normally
verified at the slow corner where the delays are the largest.
1.Flip-flop to Flip-flop Path
The Path Type line indicates that the delays shown in this report are all max path delays indicating that this is a setup check. This is because
setup checks correspond to the max (or longest path) delays through the logic. Note that the hold checks correspond to the min (or shortest path)
delays through the logic.
(which is one cycle away since this is a setup check) is at 10ns. A clock uncertainty of 0.3ns was specified for this clock - thus, the clock period is reduced
by the uncertainty margin. The clock uncertainty includes the variation in cycle time due to jitter in the clock source and any other timing
margin used for analysis.The setup time of the flip-flop 0.04ns (called library setup time), is deducted from the total capture path yielding a required
time of 9.66ns.
as ideal, that any buffers in the clock path are assumed to have zero delay. Once the clock trees are built, the clock network can be marked as propagated
- which causes the clock paths to show up with real delays, as shown in the next example timing report. The 0.11ns delay is the clock network delay on the launch
clock and the 0.12ns delay is the clock network delay on the capture flip-flop.
The timing path report can optionally include the expanded clock paths, that is, with the clock trees expl