Cross point assignment algorithm with crosstalk constraint

In this paper, an approach to resolve the coupling effect problem is proposed during the Cross Point Assignment (CPA) stage. We combine the priority queue concept with rip-up and reroute strategy to control crosstalk noise caused by interconnect coupling capacitance. First we arrange the nets into different priority queues according to their weighted sum of their length and criticality. Then the CPA problem for one queue of nets is translated into a linear assignment problem. After the assignment of one queue of nets, we perform a post-CPA checking routine to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. We have tested our algorithm by a set of bench mark examples and the experimental results are promising.

[1]  Xianlong Hong,et al.  A gridless router based on hierarchical PB corner stitching structure , 2002, IEEE 2002 International Conference on Communications, Circuits and Systems and West Sino Expositions.

[2]  Majid Sarrafzadeh,et al.  An exact algorithm for coupling-free routing , 2001, ISPD '01.

[3]  R. Burkard,et al.  Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

[4]  Marcello Pelillo,et al.  A new deterministic annealing algorithm for maximum clique , 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium.

[5]  Jason Cong,et al.  Pseudo pin assignment with crosstalk noise control , 2000, ISPD '00.

[6]  William Nicholls,et al.  Track assignment: a desirable intermediate step between global routing and detailed routing , 2002, ICCAD 2002.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  David R. Wood,et al.  An algorithm for finding a maximum clique in a graph , 1997, Oper. Res. Lett..

[9]  Xianlong Hong,et al.  FARM: an efficient feed-through pin assignment algorithm , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[10]  Carl Sechen,et al.  Timing- and crosstalk-driven area routing , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..