期刊文献+

Reliable buffered clock tree routing algorithm with process variation tolerance 被引量:1

Reliable buffered clock tree routing algorithm with process variation tolerance
原文传递
导出
摘要 When IC technology is scaled into the very deep sub-micron regime, the optical proximity effects (OPE) turn into noticeable in optical lithography. Consequently, clock skew becomes more and more susceptible to process variations, such as OPE. In this paper, we propose a new buffered clock tree routing algorithm to prevent the influence of OPE and process variations to clock skew. Based on the concept of BSF (branch sensitivity factor), our algorithm manages to reduce the skew sensitivity of the clock tree in the topology generation. The worst case skew due to the wire width change has been estimated, and proper buffers are inserted to avoid large capacitance load. Experimental results show that our algorithm can produce a more reliable, processinsensitive clock tree, and control clock skews in their permissible range evidently. When IC technology is scaled into the very deep sub-micron regime, the optical proximity effects (OPE) turn into noticeable in optical lithography. Consequently, clock skew becomes more and more susceptible to process variations, such as OPE. In this paper, we propose a new buffered clock tree routing algorithm to prevent the influence of OPE and process variations to clock skew. Based on the concept of BSF (branch sensitivity factor), our algorithm manages to reduce the skew sensitivity of the clock tree in the topology generation. The worst case skew due to the wire width change has been estimated, and proper buffers are inserted to avoid large capacitance load. Experimental results show that our algorithm can produce a more reliable, processinsensitive clock tree, and control clock skews in their permissible range evidently.
出处 《Science in China(Series F)》 2005年第5期670-680,共11页 中国科学(F辑英文版)
基金 the 863 National Hi-Tech Research and Development Plan of China(Grant No.2005AA1Z1230) the National Natural Science Foundation ofChina(Grant No.90307017).
关键词 clock routing process variation clock skew branch sensitivity factor buffer insertion. clock routing, process variation, clock skew, branch sensitivity factor, buffer insertion.
  • 相关文献

参考文献13

  • 1[1]Tsay, R. S., Exact zero skew, in Proceeding of International Conference on CAD, 1991, 336-339.
  • 2[2]Chao, T. H., Hsu, Y. C., Ho, J. M. et al., Zero skew clock routing with minimum wirelength, IEEE Transactions on Circuit and System, 1992, 39(11): 799-814.
  • 3[3]Edahiro, M., Minimum path-length equi-distant routing, in Proc. of Asia-Pacific Conf. on Circuits andSystem,1992, 41 -46.
  • 4[4]Huang, D. J. H., Kahng, A. B., Tsao, C. W. A., On the bounded-skew clock and Steiner routing problems, in Proceeding of 32nd Design Automation Conference, 1995,508- 513.
  • 5[5]Cong, J., Kahng, A. B., Koh, C. K. et al., Bounded-skew clock and Steiner routing, ACM Trans. on Design Automation of Electronics System, 1998, 3(3): 341-388.
  • 6[6]Xi, J. G., Dai, W. W. M., Useful-skew clock routing with gate sizing for low power design, in Proceeding of33rd Design Automation Conference, 1996, 383-388.
  • 7[7]Tsao, C. W., Albert, K., Cheng, K., UST/DME: a clock tree router for general skew constraints, IEEE/ACM International Conference on Computer-Aided Design, 2000, 400-405.
  • 8[8]Pavman, Z. H., Tony, M., James, D. M., Characterization and modeling of clock skew with process variations,IEEE Custom Integrated Circuit Conference, 1999, 441-444.
  • 9[9]Liu, Y., Nassif, S. R., Pileggi, L. T. et al., Impact of interconnect variations on the clock skew of a gigahertz microprocessor, Proceeding of 37th Design Automation Conference, 2000, 168-171.
  • 10[10]Desai, M. P., Cvijetetic, R., Jensen, J., Sizing of clock distribution networks for high performance CPU chips,in Proceeding of 33rd Design Automation Conference, 1996, 389-394.

同被引文献4

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部