View Related Documents

Abstract

Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.

Keywords  crosstalk - interconnect - physical design - routing - track/layer assignment - VLSI

Supported by the National Natural Science Foundation of China under Grant No.60176016, the National Hi-Tech Development 863 Program of China under Grant No. 2002AA1Z1460, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No.20020003008.

Fulltext Preview

Image of the first page of the fulltext document