首页 | 官方网站   微博 | 高级检索  
     


Incremental Placement-Based Clock Network Minimization Methodology
Authors:Qiang Zhou  &#x; ú  Yici Cai  &#x;ÿ&#x;  Liang Huang  ì ຮ  Xianlong Hong  Ú&#x;
Affiliation:aDepartment of Automation, Tsinghua University, Beijing 100084, China
Abstract:Power is the major challenge threatening the progress of very large scale integration (VLSI) tech-nology development. In ultra-deep submicron VLSI designs, clock network size must be minimized to re-duce power consumption, power supply noise, and the number of clock buffers which are vulnerable to process variations. Traditional design methodologies usually let the clock router independently undertake the clock network minimization. Since clock routing is based on register locations, register placement actu-ally strongly influences the clock network size. This paper describes a clock network design methodology that optimizes register placement. For a given cell placement result, incremental modifications are per-formed based on the clock skew specifications by moving registers toward preferred locations that may re-duce the clock network size. At the same time, the side-effects to logic cell placement, such as signal net wirelength and critical path delay, are controlled. Test results on benchmark circuits show that the methodol-ogy can considerably reduce clock network size with limited impact on signal net wirelength and critical path delay.
Keywords:clock network  incremental placement  very large scale integration (VLSI)
本文献已被 维普 万方数据 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号