期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Reliable buffered clock tree routing algorithm with process variation tolerance 被引量:1
1
作者 CAI Yicit XIONG Yan +1 位作者 HONG Xianlong LIU Yi 《Science in China(Series F)》 2005年第5期670-680,共11页
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 proce... 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. 展开更多
关键词 clock routing process variation clock skew branch sensitivity factor buffer insertion.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部