一种非零偏差时钟网布线算法  

A Non-Zero Skew Clock Tree Routing Algorithm

作　　者：孙骥[1] 毛军发[1] 李晓春[1] 

机构地区：[1]上海交通大学电子工程系,上海200030

出　　处：《微电子学》2005年第3期293-296,共4页Microelectronics

基　　金：国家自然科学基金资助项目(90207010)

摘　　要：特定的非零偏差时钟网比零偏差时钟网更具优势,它有助于提高时钟频率、降低偏差的敏感度。文章提出了一种新的非零偏差时钟树布线算法,它结合时钟节点延时和时钟汇点位置,得到一个最大节点延时次序合并策略,使时钟树连线长度变小。实验结果显示,这种算法与典型的最邻近选择合并策略相比较,可以减少20%～30%的总连线长度。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.

关 键 词：时钟网布线 非零时钟偏差 节点延时 蛇形线 

分 类 号：TN402[电子电信—微电子学与固体电子学]