Recursive channel router

An extended true vertical-horizontal-vertical (VHV)-model three-layer channel routing algorithm is described. The algorithm is based on the observation that, after routing a track on either the top or bottom side of the channel, it is possible to define a new channel routing problem and call the router recursively. The routing task then is reduced to making optimal use of a track. Routing of track is done in two steps. For the first step, the authors present a segment selection method, which aims at reducing the channel density. The second step further fills up the track and, at the same time, aims at reducing the heights of the vertical constraint graphs.<<ETX>>

[1]  Ernest S. Kuh,et al.  Glitter: A Gridless Variable-Width Channel Router , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Michael Burstein,et al.  Hierarchical Channel Router , 1983, 20th Design Automation Conference Proceedings.

[3]  Walter Heyns.  The 1-2-3 Routing Algorithm or the Single Channel 2-Step Router on 3 Interconnection Layers , 1982, DAC 1982.

[4]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.

[5]  Yun Kang Chen,et al.  Three-Layer Channel Routing , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  R. Pelavin,et al.  Hierarchical channel router , 1988, 25 years of DAC.

[7]  C. L. Liu,et al.  NEW APPROACH TO THE THREE LAYER CHANNEL ROUTING PROBLEM. , 1987 .