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

一种非零偏差时钟网布线算法
引用本文:孙骥,毛军发,李晓春.一种非零偏差时钟网布线算法[J].微电子学,2005,35(3):293-296.
作者姓名:孙骥  毛军发  李晓春
作者单位:上海交通大学,电子工程系,上海,200030
摘    要:特定的非零偏差时钟网比零偏差时钟网更具优势,它有助于提高时钟频率、降低偏差的敏感度.文章提出了一种新的非零偏差时钟树布线算法,它结合时钟节点延时和时钟汇点位置,得到一个最大节点延时次序合并策略,使时钟树连线长度变小.实验结果显示,这种算法与典型的最邻近选择合并策略相比较,可以减少20%~30%的总连线长度.

关 键 词:时钟网布线  非零时钟偏差  节点延时  蛇形线
文章编号:1004-3365(2005)03-0293-04

A Non-Zero Skew Clock Tree Routing Algorithm
Sun Ji,MAO Jun-fa,LI Xiao-chun.A Non-Zero Skew Clock Tree Routing Algorithm[J].Microelectronics,2005,35(3):293-296.
Authors:Sun Ji  MAO Jun-fa  LI Xiao-chun
Abstract:The specified non-zero skew clock tree is better than zero skew clock trees. It can improve clock frequency and tolerance to process variations. In this paper,a new non-zero skew clock tree routing algorithm is proposed. Considering the relation between node delay and sink location, a maximum node delay ordering merging scheme is proposed to minimize wire length. Experimental results show that the proposed algorithm can reduce the total wire length by 20% to 30% over typical nearest-neighbor selection merging scheme.
Keywords:Clock tree routing  Non-zero skew  Node delay  Wire snaking
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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