loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eleventh International Conference on VLSI Design: VLSI for Signal Processing
Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model
India
January 04-January 07
ISBN: 0-8186-8224-8
Sandip Das, North Bengal University
Susmita Sur-Kolay, Jadavpur University
Bhargab B. Bhattacharya, Indian Statistical Institute
New techniques are presented for routing L-shaped channels, switchboxes and staircases in 2-layer Manhattan-diagonal (MD) model with tracks in horizontal, vertical directions.First, a simple time algorithm is proposed which routes any L-shaped channel with length density and no cyclic vertical constraints, in tracks. Next, a time greedy method for routing an L-shaped channel with cyclic vertical constraints, is described. Then, the switchbox routing problem in MD model is solved elegantly. These techniques easily extendible to 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.
Index Terms:
VLSI routing, nonslicible floorplan, channel, switchbox, Manhattan-diagonal model
Citation:
Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya, "Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model," vlsid, pp.65, Eleventh International Conference on VLSI Design: VLSI for Signal Processing, 1998
Usage of this product signifies your acceptance of the Terms of Use.