Abstract
This paper presents algorithms for multiterminal net channel routing where multiple interconnect layers are available. Major improvements are possible if wires are able to overlap, and our generalized main algorithm allows overlap, but only on everyKth (K ź 2) layer. Our algorithm will, for a problem with densityd onL layers,L źK + 3,provably use at most three tracks more than optimal: ź(d + 1)/źL/Kźź + 2 tracks, compared with the lower bound of źd/źL/Kźź. Our algorithm is simple, has few vias, tends to minimize wire length, and could be used if different layers have different grid sizes. Finally, we extend our algorithm in order to obtain improved results for adjacent (K = 1) overlap: ź(d + 2)/ź2L/3źź + 5 forL ź 7.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
