This Article 
 Bibliographic References 
 Add to: 
Optimal Three-Layer Channel Routing
May 1984 (vol. 33 no. 5)
pp. 427-437
F.P. Preparata, Coordinated Science Laboratory, University of Illinois
In this paper we show that any channel routing problem of density d involving only two-terminal nets can always be solved in the knock-knee mode in a channel of width equal to the density d with three conducting layers. An algorithm is described which produces in time O(n log n) (in its simplest implementation) a layout of n nets with the following properties: 1) it has minimal width d; 2) it can be realized with three layers; 3) it has at most 3n vias; 4) any two wires share at most four grid points. Without sacrificing any of the above properties (but possibly obtaining slightly longer wires), the layout algorithm can be modified to run in time ?(n).
Index Terms:
VLSI layouts, Channel routing, multilayer wiring, optimal algorithms, VLSI design
F.P. Preparata, W., Jr. Lipski, "Optimal Three-Layer Channel Routing," IEEE Transactions on Computers, vol. 33, no. 5, pp. 427-437, May 1984, doi:10.1109/TC.1984.1676459
Usage of this product signifies your acceptance of the Terms of Use.