论文部分内容阅读
提出了一种确定区域的详细布线算法，它能对不同设计模式进行布线．该算法能适用于任意多层布线情况，并且支持不同布线层具有的不同工艺参数．在构造布线树时，考虑芯片当前的走线拥挤度，使布线比较平均，并加快了算法运行速度、改善了布线质量．在连接两点线网时，构造基于二维迷宫布线结果的分层图，提出了一种对分层图的启发式染色算法来进行布线层分配，大大提高算法布线速度．采用拆线重布的方法来处理布线失败的线网．
A detailed routing algorithm for determining the area is proposed, which can route different design patterns. The algorithm can be applied to any multi-layer wiring, and supports different process parameters of different wiring layers. When constructing the routing tree, the current routing congestion of the chip is considered, the routing is averaged, the speed of the algorithm is accelerated, and the quality of the routing is improved. When the two-point net is connected, a hierarchical graph based on the results of two-dimensional maze routing is constructed. A heuristic coloring algorithm for the layered graph is proposed to allocate the routing layer and greatly improve the routing speed of the algorithm. The use of stitches rewinding method to deal with the failure of the wiring network.