Minimum crosstalk channel routing

Author

Gao, Tong ; Liu, C.L.

Author_Institution

Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA

Volume

15

Issue

5

fYear

1996

fDate

5/1/1996 12:00:00 AM

Firstpage

465

Lastpage

474

Abstract

As technology advances, interconnection wires are placed in closer proximity and circuits operate at higher frequencies. Consequently, reduction of crosstalk between interconnection wires becomes an important consideration in VLSI design. In this paper, we study the gridded channel routing problem with the objective of satisfying crosstalk constraints for the nets. We proposed a new approach to the problem which utilizes existing channel routing algorithms and improves upon the routing results by permuting the routing tracks. The permutation problem is proven to be NP-complete. A novel mixed ILP formulation and effective procedures for reducing the number of variables and constraints in the mixed ILP formulation are then presented. The new algorithm is tested on three large benchmark circuits as well as many randomly generated circuits. The experimental results are very promising

Keywords

VLSI; circuit layout CAD; computational complexity; crosstalk; integer programming; integrated circuit interconnections; integrated circuit layout; linear programming; network routing; NP-complete problem; VLSI design; gridded channel routing problem; interconnection wires; minimum crosstalk channel routing; mixed ILP formulation; permutation problem; Capacitance; Circuit testing; Coupling circuits; Crosstalk; Delay; Frequency; Integrated circuit interconnections; Routing; Very large scale integration; Wires;

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.506134

Filename

506134