A Study on a 2 Layer Channel Router Considering Cycle Problems

사이클 문제를 고려한 2층채널 배선기에 관한 연구

In this paper, a channel routing algorithm which considers cycle problem is proposed. The requirements of routing is given by pin numbers which imply interconnections between a upper block and lower block of the channel. Output is represented by interconnections among equipotential pins. When input is given, the algorithm constructs a channel representation graph and makes weight of each net. And then it checks cycle and finidhes the routing. If the cycle is detected, it finds path with maze routing. This algorithm have coded in C language on IBM-PC /AT. If cycle is not detected, the results are near optimal values. If it is detected, routing is possible as well.