Integrated routing resource assignment for RLC crosstalk minimization

Author

Cai, Yici ; Liu, Bin ; Zhou, Qiang ; Hong, Xianlong

Author_Institution

Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China

fYear

2005

fDate

23-26 May 2005

Firstpage

1871

Abstract

The paper deals with the crosstalk problem for DSM designs in an integrated routing resource assignment stage containing the various operations between global routing and detailed routing. The heuristic proposed for minimizing RLC crosstalk noise is in two-stages: the coarse assignment problem with shield planning is formulated as a max-k-cut of the coarse coupling graph, and solved with SDP; in detailed assignment, a dynamic priority queue is employed to ensure that each segment is assigned properly. Experimental results corroborate the effectiveness and efficiency of the algorithm.

Keywords

VLSI; crosstalk; graph theory; integrated circuit interconnections; integrated circuit layout; minimisation; network routing; RLC crosstalk minimization; VLSI wires; coarse coupling graph; detailed routing; dynamic priority queue; global routing; heuristic; integrated routing resource assignment; max-k-cut; shield planning; Algorithm design and analysis; Clocks; Computer science; Costs; Crosstalk; Frequency; Heuristic algorithms; Routing; Very large scale integration; Wires;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Print_ISBN

0-7803-8834-8

Type

conf

DOI

10.1109/ISCAS.2005.1464976

Filename

1464976