Title of article
Routing multiterminal nets on a hexagonal grid Original Research Article
Author/Authors
Xuehou Tan، نويسنده , , Xiaoyu Song، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
11
From page
245
To page
255
Abstract
Channel routing is a vital task in the layout design of VLSI circuits. Multiterminal channel routing is different from two-terminal one. While the later is quite understood, the former still poses the difficulty. In this paper, we investigate the multiterminal channel routing problem in a hexagonal model, whose grid is composed of horizontal tracks, right tracks (with slope +60°), and left tracks (with slope −60°). We present an efficient algorithm for routing multiterminal nets on a channel of width d + 3, where d is the problem density. Furthermore, we can wire the layout produced by the router using four layers and there are no overlaps among different layers. This improves the previous known results [15, 19].
Keywords
Hexagonal grids , Channel routing , Wiring , Algorithms , VLSI layout , Times square model
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884855
Link To Document