Recursive channel router

Authors:
W. Heyns;K. Van Nieuwenhove
Affiliations:
Silvar-Lisco, Abdijstraat 34, B-3030 Leuven, Belgium;Silvar-Lisco, Abdijstraat 34, B-3030 Leuven, Belgium
Venue:
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Year:
1988

Citing 3
Cited 0

Hierarchical channel router

DAC '83 Proceedings of the 20th Design Automation Conference
The 1-2-3 routing algorithm or the single channel 2-step router on 3 interconnection layers

DAC '82 Proceedings of the 19th Design Automation Conference
A “greedy” channel router

DAC '82 Proceedings of the 19th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an extended 'true' VHV-model 3 layer channel routing algorithm. The algorithm is based on the observation that, after having routed a track on either the top or bottom side of the channel, one can 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 a track is done in 2 steps. For the first step, we will 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.