SDG Channel Routing to Minimize Wirelength for Generalized Channel

抄録

In this paper, SDG channel routing algorithm for generalized channel is proposed. In generalized channel, it is assumed that horizontal routing capacity is tight and that all pins of a net are needed to be connected by a Single Trunk Steiner Tree. Also, it is requested to reduce the total length of nets to accomplish the routing, and our goal is to reduce the total vertical length as much as possible. Our proposed algorithm determines the track assignment of nets iteratively according to the net priority that is defined to reduce the vertical length. In experiments, it is confirmed that the vertical length is reduced by around 30% to 50% compared with the track assignment by Left-Edge, and that it is very close to a lower bound.