New techniques are presented for routing L-shaped channels, switchboxes and staircases in 2-layer Manhattan-diagonal (MD) model with tracks in horizontal, vertical and /spl plusmn/45/spl deg/ directions. First, a simple O(l.d) time algorithm is proposed which routes any L-shaped channel with length l, density d and no cyclic vertical constraints, in w (d/spl les/w/spl les/d+1) tracks. Next, an O(l.w) time greedy method for routing an L-shaped channel with cyclic vertical constraints, is described. Then, the switchbox routing problem in the MD model is solved elegantly. These techniques, easily extendible to the routing of staircase channels, yield efficient solutions to detailed routing in general floorplans. Experimental results show significantly low via-count and reduced wire length, thus establishing the superiority of MD-routing over classical strategies.
展开▼
机译：提出了用于在2层曼哈顿对角线（MD）模型中路由L形通道，配电箱和楼梯的新技术，该模型具有在水平，垂直和/ spl plusmn / 45 / spl deg /方向上的轨道。首先，提出了一种简单的O（l.d）时间算法，该算法在w（d / spl les / w / spl les / d + 1）条轨迹中路由长度为l，密度为d且无循环垂直约束的任何L形通道。接下来，描述用于路由具有循环垂直约束的L形信道的O（l.w）时间贪婪方法。然后，很好地解决了MD模型中的配电箱布线问题。这些技术易于扩展到楼梯通道的布线，可为常规平面图中的详细布线提供有效的解决方案。实验结果表明，通孔数明显减少，导线长度缩短，因此建立了MD布线优于传统策略的优势。
展开▼
