通孔最小化的三层不规则边界通道布线

A VIA MINIMIZATION CHANNEL ROUTER FOR THREE-LAYER CHANNEL WITH IRREGULAR BOUNDARIES

提出了一种以连通孔和布线区域最小化为目标的三层不规则边界通道布线算法。算法将通道边界的凹陷区域看成固定障碍,利用填充和压缩方法,使线网绕过障碍,实现互连。算法已用PASCAL语言编程,并在XT/286机上实现。结果表明,该算法不仅使通孔数减少,而且由于利用了各凹陷区域之间的面积进行布线,通道宽度也相应减小。

In LSI/VLSI chip layout design, channel routing is one of the key steps. Generally, boundaries of the channel are two parallel lines. But sometimes, because of the different sized cells or macro cells, there may be some indentations on boundaries of the channel. In this paper, a channel router for three-layer channel with irregular boundaries is presented. The numbers of both vias and tracks are taken as the objectives. This algorithm has been coded in PASCAL and implemented. The experimental results are satisfactory.