A New Efficient Channel Routing
Lishan Microelectoronics · Microelectronics & Computer · 1992
In this paper , we have studed the subnets and weighted path algorithm, proposed a new algorithm for channel routing. In this algorithm the number of the interconnecting holes are reduced by merging the subnets. On the weighting for nets we not only have considered the horizotal restrain and vertical restrain, but also have considered the nets connection, nets length and critical nets. Using this algorithm for some standard examples of routing, results show that this algorithm is efficient.