Timing closure: the solution and its problems

In this paper we summarize the derivation of the size equations, the key to timing closure, which is the dimensioning of a logic network such that timing constraints are satisfied. Next we present a number of problems when applying these equations in practice. The main ones are network generation, discrete libraries, size constraints, and resistive interconnect.