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.