摘要
本文提出一种高性能超大规模集成电路无网格布线算法。对于给定的布线平面,算法首先生成该布线平面的非均匀网格图,然后以绕障长度为布线参数,采用优化迷宫算法完成具体的布线过程。算法保证能够找到存在的最短布线路径,并能进行变线宽、变线距布线,布线速度很快,效果很好。
A gridless routing algorithm for VLSI design is presented in this paper. For a given routing plane, the algorithm firstly generates its corresponding Non-Uniform Grid Graph, after that, it uses optimal maze routing algorithm guided by calculated detoured length to complete the final routing. The algorithm can guarantee to find the existing shortest routing path and can perform wire sizing and wire spacing optimization on this path. Experimental results show that it is a fast and efficient algorithm.
出处
《电路与系统学报》
CSCD
2002年第4期13-16,共4页
Journal of Circuits and Systems
基金
国家863计划(863-SOC-Y-3-3)资助项目
