Skip to Main Content
We consider routing models that consist of L layers in which each layer can contain horizontal and vertical wires and in which up to k wires on different layers are allowed to run on top of each other. Within this overlap model we study the relationship between the channel width, the number of contact points, and the amount of overlap used for routing n two-terminal nets across a channel. For k ≤ [L/2] - 2 we show how to solve the channel routing problem using [d/k] + 1 tracks, which is only one track more than the optimal channel width. We extend this algorithm to values of k in the range [L/2] - 1 ≤ k ≤ [L/2] +1. We also present algorithms for the 3- and 4-layer model with double overlap that use fewer tracks than our general channel routing algorithm. All algorithms use O(n) contact points and can be implemented to run in O(n) time.
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on (Volume:4 , Issue: 1 )
Date of Publication: January 1985