Clock network minimization methodology based on incremental placement

In ultra-deep submicron VLSI circuits, clock network is a major source of power consumption and power supply noise. Therefore, it is very important to minimize clock network size. Traditional design methodologies usually let the clock router to undertake the task of clock network minimization independently. Since a clock routing is carried out based on register locations, register placement actually has fundamental influence to a clock network size. In this paper, we propose a new clock network design methodology that incorporates register placement optimization. Given a cell placement result, incremental modifications are performed according to clock skew specifications. The incremental placement change moves registers toward preferred locations that may enable a small clock network size. At the same time, the side-effect to logic cell placement and wire connections is controlled. Experimental results on benchmark circuits show that the proposed methodology can reduce clock network size considerably with limited impact on signal net wirelength and critical path delay.

[1]  Jiang Hu,et al.  Buffered clock tree for high quality IC design , 2004, International Symposium on Signals, Circuits and Systems. Proceedings, SCS 2003. (Cat. No.03EX720).

[2]  Yongqiang Lyu,et al.  Combining clustering and partitioning in quadratic placement , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[3]  Zhuoyuan Li,et al.  Incremental placement algorithm for standard-cell layout , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[4]  Xianlong Hong,et al.  CEP: a clock-driven ECO placement algorithm for standard-cell layout , 2001, ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).

[5]  Cheng-Kok Koh,et al.  UST/DME: a clock tree router for general skew constraints , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[6]  Sachin S. Sapatnekar,et al.  Clock Skew Optimization , 1999 .

[7]  Dinesh Bhatia,et al.  Clock-skew constrained placement for row based designs , 1998, Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273).

[8]  J. G. Xi,et al.  Useful-Skew Clock Routing with Gate Sizing for Low Power Design , 1996, 33rd Design Automation Conference Proceedings, 1996.

[9]  Dinesh Bhatia,et al.  Clock-skew constrained cell placement , 1996, Proceedings of 9th International Conference on VLSI Design.

[10]  Andrew B. Kahng,et al.  On the Bounded-Skew Clock and Steiner Routing Problems , 1995, 32nd Design Automation Conference.

[11]  Sachin S. Sapatnekar,et al.  A graph-theoretic approach to clock skew optimization , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[12]  Jan-Ming Ho,et al.  Zero skew clock routing with minimum wirelength , 1992 .

[13]  Arvind Srinivasan,et al.  RITUAL: a performance driven placement algorithm for small cell ICs , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[14]  John P. Fishburn,et al.  Clock Skew Optimization , 1990, IEEE Trans. Computers.