Clock network minimization methodology based on incremental placement

ABSTRACT

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.

REFERENCES

• 1: Rishi Chaturvedi , Jiang Hu, Buffered Clock Tree for High Quality IC Design, Proceedings of the 5th International Symposium on Quality Electronic Design, p.381-386, March 22-24, 2004
• 2: Ting-Hai Chao, Yu-Chin Hsu, Jan-Ming Ho, Kenneth D. Boese, Andrew B. Kahng, "Zero skew clock routing with minimum wirelength", IEEE Transactions on Circuits & Systems II: Analog & Digital Signal Processing, v 39, n 11, Nov, 1992, pp. 799--814.
• 3: Joe G. Xi , Wayne W.-M. Dai, Useful-skew clock routing with gate sizing for low power design, Proceedings of the 33rd annual conference on Design automation, p.383-388, June 03-07, 1996, Las Vegas, Nevada, United States [doi>10.1145/240518.240592]
• 4: Chung-When Albert Tsao, Cheng-Kok Koh, "UST/DME: a clock tree router for general skew constraints", ICCAD 2000, pp. 400--405.
• 5: Dennis J. H. Huang , Andrew B. Kahng , Chung-Wen Albert Tsao, On the bounded-skew clock and Steiner routing problems, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.508-513, June 12-16, 1995, San Francisco, California, United States [doi>10.1145/217474.217579]
• 6: V. Natesan , D. Bhatia, Clock-Skew Constrained Cell Placement, Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication, p.146, January 03-06, 1996
• 7: Clock-Skew Constrained Placement for Row Based Designs, Proceedings of the International Conference on Computer Design, p.219, October 05-05, 1998
• 8: Yi Liu, Xianlong Hong, Yici Cai, Weimin Wu, "CEP: A clock-driven ECO placement algorithm for standard-cell layout", ASICON 2001, pp. 118--121.
• 9: Zhuoyuan Li, Weimin Wu, Xianlong Hong, Jun Gu, "Incremental placement algorithm for standard cell layout", ISCAS 2002, pp. 2.883--2.886.
• 10: Rahul B. Deokar, Sachin S. Sapatnekar, "A graph-theoretic approach to clock skew optimization", ISCAS 1994, pp. 1.407--1.410.
• 11: John P. Fishburn, Clock Skew Optimization, IEEE Transactions on Computers, v.39 n.7, p.945-951, July 1990 [doi>10.1109/12.55696 ]
• 12: Arvind Srinivasan, Kamal Chaudhary, E. S. Kuh, "RITUAL: performance driven placement algorithm for small cell ICs", ICCAD 1991, pp. 48--51.
• 13: Yongqiang Lu, Xianlong Hong, Wenting Hou, Weimin Wu, Yici Cai, "Combining clustering and partitioning in quadratic placement", ISCAS 2003, pp. 4.720--4.723.