An optimal channel-routing algorithm in the times square model

Author

Song, Xiaoyu ; Tan, Xuehou

Author_Institution

Dept. d´´Inf. et de Recherche Oper., Montreal Univ., Que., Canada

Volume

13

Issue

7

fYear

1994

fDate

7/1/1994 12:00:00 AM

Firstpage

891

Lastpage

898

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°) and left tracks (with slope -60°). 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

Keywords

VLSI; circuit layout CAD; network routing; optimisation; VLSI layout design; channel width bound; horizontal tracks; left tracks; optimal algorithm; optimal channel-routing algorithm; right tracks; routing optimality; time-consuming; times square model; two-terminal channel routing problem; zig-zag connections; Algorithm design and analysis; Design automation; Joining processes; Process design; Routing; Sorting; Upper bound; Very large scale integration; Wires; Wiring;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.293946

Filename

293946