A min-area solution to performance and RLC crosstalk driven global routing problem

This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm is consisted of three key parts: (1) timing and congestion optimization; (2) crosstalk budgeting and estimation; and (3) crosstalk elimination and local refinement. Compared with the recent work introduced in (Zhang et al., 2003) and (Zhang et al., 2004), the proposed algorithm can achieve smaller routing area and fewer shields under the same design constraints, yet use less running time.

[1]  Lei He,et al.  Towards global routing with RLC crosstalk constraints , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[2]  Jinjun Xiong,et al.  Performance and RLC crosstalk driven global routing , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[3]  Ling Zhang,et al.  Performance optimization global routing with RLC crosstalk constraints , 2003, ASICON 2003.

[4]  Yici Cai,et al.  A novel and efficient timing-driven global router for standard cell layout design based on critical network concept , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[5]  Dongsheng Wang,et al.  Post global routing crosstalk synthesis , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..