Optimal sizing of high-speed clock networks based on distributed RC and lossy transmission line models
Authors:
- W.W.-M. DaiWDW.W.-M. Dai
- J.G. XiJXJ.G. Xi
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 628-633
Abstract
To achieve delay balance, instead of making the faster path slower by elongating branches, we make slower paths faster by sizing. Given a general clock network, which may includes loops, together with a set of feasible widths for each branch, we formulate the optimal sizing of the clock network as a constrained optimization problem. By turning the skew minimization problem into a least-squares estimation problem, a modified Gauss-Marquardt's method is used to determine the optimal widths. An efficient initial sizing algorithm is proposed to speed up the sizing process. Instead of using zero-order delay model (path length) or one-order delay model (Elmore delay), we employ a generalized delay model which can handle general RLC and transmission line networks. Experimental results show that this method significantly reduces both the clock skew and path delays from source to terminals.Keywords
This publication has 9 references indexed in Scilit:
- Zero skew clock net routing2003
- Exact zero skew2002
- Clock routing for high-performance ICs2002
- S-parameter based macro model of distributed-lumped networks using exponentially decayed polynomial function1993
- Performance-driven interconnect design based on distributed RC delay model1993
- Perfect-balance planar clock routing with minimal path-length1992
- High-performance clock routing based on recursive geometric matching1991
- Properties of interconnection on silicon, sapphire, and semi-insulating gallium arsenide substratesIEEE Transactions on Electron Devices, 1982
- An Algorithm for Least-Squares Estimation of Nonlinear ParametersJournal of the Society for Industrial and Applied Mathematics, 1963