首页 | 本学科首页   官方微博 | 高级检索  
     


Reliable buffered clock tree routing algorithm with process variation tolerance
Authors:Email author" target="_blank">Cai?Yici?Email author  Xiong?Yan  Hong?Xianlong  Liu?Yi
Affiliation:1. Department of Computer Science and Technology,University of Science and Technology of China,Hefei 230026,China;Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China
2. Department of Computer Science and Technology,University of Science and Technology of China,Hefei 230026,China
3. Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China
Abstract: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, process- insensitive clock tree, and control clock skews in their permissible range evidently.
Keywords:clock routing  process variation  clock skew  branch sensitivity factor  buffer insertion  
本文献已被 CNKI 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号