Abstract
Routing is a crucial problem in the VLSI layout design automation process. In this paper we study the channel routing problem for multiterminal nets in the knock-knee diagonal model (KKD), where the grid consits of right and left tracks displayed at +45° and −45°. We give three results in KKD by a unified and simple algorithm. Let d be the density of a given channel routing problem and w the width of channel. We have: (a) if all nets are two-terminal nets, then d + 1 is an upper bound to w (solved optimally); (b) if all nets are two- or three-terminal nets, then [ 3d 2 ] + 1 is an upper bound to w; (c) 2d is always an upper bound to w in KKD.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
