VLSI总体布线算法研究与实现  

Research and Realization on Global Routing Algorithm

作　　者：杨垠丹[1] 葛海通[1] 严晓浪[1] 

机构地区：[1]浙江大学超大规模集成电路设计研究所,浙江杭州310027

出　　处：《电路与系统学报》2003年第5期47-50,共4页Journal of Circuits and Systems

基　　金：国家863计划资助(2002AA1Z1460)

摘　　要：总体布线是布图设计中一个极为重要的设计环节。本文提出了基于可分离最小生成树(SMST)的优化L形直角斯坦(Steiner)树(L_RST)和优化Z_RST的算法。该算法实现上绕开计算重合度问题,以新的角度计算代价。利用基于tile的结构,实现了伪管脚(pseudo pin)的分配,适用于现代多层布线需求。最后文章研究了同时考虑串扰和时延的综合性能驱动的总体布线算法改进。Global routing is a significant part of layout design. Based on separable rectilinear minimum spanning tree (SMST), optimal algorithms for rectilinear Steiner tree L_RST and optimal Z_RST are presented. According to these algorithms, cost is computed following different way without solving the problem of overlaps. Tile_based global router is used to facilitate the distribution of pseudo pins. In the end of this paper, problems such as cross-talk and delay driven (integrated performance driven) are also discussed to improve the global routing algorithm. The proposed algorithm is quite suitable for modern multi-layer routing.

关 键 词：总体布线 可分离最小生成树 直角斯坦纳树 伪管脚 

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