基于延迟合并嵌入的带障碍的时钟树布线算法  

A DME-Based Clock Routing Algorithm with the Treatment of Obstacles

作　　者：黄惠萍[1] 陆伟成[1] 付强[1] 赵文庆[1] 

机构地区：[1]复旦大学专用集成电路与系统国家重点实验室,上海201203

出　　处：《计算机辅助设计与图形学学报》2008年第6期718-723,共6页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(90307017;60676018);国家"九七三"重点基础研究发展规划项目(2005CB321701);教育部跨世纪优秀人才培养计划基金;教育部高等学校博士学科点专项科研基金(20050246082);上海市自然科学基金(05JC14007)

摘　　要：提出一种在带障碍情况下,基于延迟合并嵌入方法的时钟树构建算法,并在时钟树构造过程中引入了轨迹图以保证布线可以绕过障碍.该算法以已知障碍为布线约束,首先自底向上计算时钟树内部节点的可能位置,然后自顶向下确定每个节点的确切位置.实验结果表明,该算法能够正确、有效地实现有障碍存在时的时钟树布线,线长优化率超过7%.An effective algorithm DMEO applying the deferred-merge embedding （DME） algorithm is presented for clock tree construction in the presence of obstacles. During the clock routing, a track graph is constructed in order to guarantee the obstacle-avoidance. By considering obstruction as routing constraint, the method is composed of a bottom-up phase computing possible loci of nodes and a top-down step to determine the exact placement of each node in the clock topology tree. Experimental results show that the algorithm is promising with more than 7 ＆ wirelength reduction.

关 键 词：时钟布线 障碍 延迟合并嵌入 指定偏差 

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