All existing algorithms for clock schedule optimization are conservative since they use only topological analysis to estimate the delays of paths between latches. This paper proposes a novel algorithm that accounts for false paths (over several time frames) in level-sensitive sequential circuits to obtain tighter bounds on the optimum clock schedule than previously obtainable.
Index Terms:
clocks; scheduling; delays; flip-flops; sequential circuits; timing; circuit optimisation; clock schedule optimization; delays; latches; false paths; time frames; level-sensitive sequential circuits
Citation:
A. Saldanha, N.V. Shenoy, R.K. Brayton, A.L. Sangiovanni-Vincentelli, "Functional clock schedule optimization," vlsid, pp.93, 8th International Conference on VLSI Design, 1995