Single-layer global routing

Author

Liao, Kuo-Feng ; Sarrafzadeh, Majid ; Wong, C.K.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA

fYear

1991

fDate

23-27 Sep 1991

Lastpage

38078

Abstract

Introduces the single-layer global routing problem, also called homotopic routing. A new technique, Density-Algorithm, is proposed to determine the global routing for each net (if there exists one) such that the number of routed nets are maximized. An optimal postprocessing algorithm, minimizing wire length and number of bends, under homotopic transformation, is presented to further improve the routing result. Experiments on several test data show that the proposed technique is effective

Keywords

VLSI; application specific integrated circuits; circuit layout CAD; network routing; Density-Algorithm; VLSI; homotopic routing; homotopic transformation; number of bends minimization; number of routed nets; optimal postprocessing algorithm; single-layer global routing problem; wire length minimization; Computer science; Data structures; Fabrication; Routing; Testing; Tiles; Very large scale integration; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

ASIC Conference and Exhibit, 1991. Proceedings., Fourth Annual IEEE International

Conference_Location

Rochester, NY

Print_ISBN

0-7803-0101-3

Type

conf

DOI

10.1109/ASIC.1991.242895

Filename

242895

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3350332