DocumentCode :
3386557
Title :
Routing of L-shaped channels, switchboxes and staircases in Manhattan-diagonal model
Author :
Das, Sandip ; Sur-Kolay, Susmita ; Bhattacharya, Bhargab B.
Author_Institution :
Dept. of Comput. Sci., North Bengal Univ., Darjeeling, India
fYear :
1998
fDate :
4-7 Jan 1998
Firstpage :
65
Lastpage :
70
Abstract :
New techniques are presented for routing L-shaped channels, switchboxes and staircases in 2-layer Manhattan-diagonal (MD) model with tracks in horizontal, vertical and ±45° directions. First, a simple O(l.d) time algorithm is proposed which routes any L-shaped channel with length l, density d and no cyclic vertical constraints, in w (d⩽w⩽d+1) tracks. Next, an O(l.w) time greedy method for routing an L-shaped channel with cyclic vertical constraints, is described. Then, the switchbox routing problem in the MD model is solved elegantly. These techniques, easily extendible to the routing of staircase channels, yield efficient solutions to detailed routing in general floorplans. Experimental results show significantly low via-count and reduced wire length, thus establishing the superiority of MD-routing over classical strategies
Keywords :
VLSI; circuit layout CAD; integrated circuit layout; multichip modules; network routing; network topology; 2-layer model; L-shaped channel routing; MCM layout; Manhattan-diagonal model; VLSI layout; cyclic vertical constraints; floorplans; low via-count; staircase routing; switchbox routing; wire length reduction; Binary trees; Computer science; Crosstalk; Geometry; Microelectronics; Routing; Semiconductor device modeling; Solid modeling; Topology; Wire;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI Design, 1998. Proceedings., 1998 Eleventh International Conference on
Conference_Location :
Chennai
ISSN :
1063-9667
Print_ISBN :
0-8186-8224-8
Type :
conf
DOI :
10.1109/ICVD.1998.646580
Filename :
646580
Link To Document :
بازگشت