Journal ArticleDOI
An optimal channel-routing algorithm in the times square model
Xiaoyu Song,Xuehou Tan +1 more
Reads0
Chats0
TLDR
This paper considers the two-terminal channel routing problem in the new routing model, called times square model (TSM), and presents an optimal algorithm, which obtains [2d/3]+2 as an upper bound to the channel width where d is the channel density.Abstract:
Channel routing is an important, time-consuming, and difficult problem in VLSI layout design, In this paper, we consider the two-terminal channel routing problem in the new routing model, called times square model (TSM); see, Lodj, Info. Proc. Lett., vol. 35, p. 41, 1990.; where the grid is composed of horizontal tracks, right tracks (with slope +60/spl deg/) and left tracks (with slope -60/spl deg/). We show a new lower bound [2d/3]-1 to the width of channel and present an optimal algorithm for two-terminal channel routing problems, which obtains [2d/3]+2 as an upper bound to the channel width where d is the channel density. The algorithm not only utilizes the horizontal tracks, but also the zig-zag connections, thus achieving the routing optimality. >read more
Citations
More filters
Book ChapterDOI
Steiner Minimum Trees in Uniform Orientation Metrics
TL;DR: The Steiner tree problem as mentioned in this paper is an NP-hard problem, and it is known as the Steiner Minimum Spanning Tree (SMT) problem, which is NP-complete.
Journal ArticleDOI
Hexagonal three-layer channel routing
Xuehou Tan,Xiaoyu Song +1 more
TL;DR: This paper presents a simple routing algorithm, which produces a layout in a channel of width w ⩽ 2d + 1.5d, which solves the open problem of three-layer wirability in [10].
Fixed Orientation Interconnection Problems: Theory, Algorithms and Applications
TL;DR: This doctoral dissertation is a collection of twelve papers and a survey on the fixed orientation Steiner tree problem and some of its gen eralizations, with one of the main contributions is a linear time algorithm for computing a Steiner minimum tree for a given full topology.
Journal ArticleDOI
Routing multiterminal nets on a hexagonal grid
Xuehou Tan,Xiaoyu Song +1 more
TL;DR: This paper presents an efficient algorithm for routing multiterminal nets on a channel of width d + 3, where d is the problem density and can wire the layout produced by the router using four layers and there are no overlaps among different layers.
Journal ArticleDOI
Congestion estimation for hexagonal routing
TL;DR: This paper presents a novel approach to estimating the routing congestion on the hexagonal model with bounded-length detours, which is the first probabilistic estimation work on hexagonal topologies.
References
More filters
Journal ArticleDOI
A preliminary study of a diagonal channel-routing model
TL;DR: The layout of two-terminal nets in a VLSI channel is realized in a new diagonal channel-routing model (DCRM), where the tracks are segments respectively displayed at +45 ° and −45 ° on the two layers of the channel.
Proceedings ArticleDOI
Novel routing schemes for IC layout part I: Two-layer channel routing
TL;DR: Preliminary results show that a class of channel muting problems cart be muted in height less than the Manhattan density.
Journal ArticleDOI
Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
TL;DR: In this article, the authors give unified and simplified algorithms and proofs for three results on channel routing in knock-knee mode, and show that 2dmax-1 tracks always suffice.
Proceedings ArticleDOI
An approximation algorithm for manhattan routing
TL;DR: In this article, it was shown that every channel can be routed using 2d+O(1) tracks, where O(n) is the number of tracks required for each channel.
Journal ArticleDOI
A 2 d channel router for the diagonal model
TL;DR: A new lower bound to the channel width equal to d is proved, and an algorithm is presented that obtains 2 d + 3 as an upper bound, where d is the channel density.