Performance and RLC crosstalk driven global routing

This work presents a global routing algorithm that minimizes total wire length and satisfies RLC crosstalk constraints specified at sinks. Our algorithm is based on critical network concept and search space traversing technology (SSTT) for global routing synthesis and tabu search for shield insertion and net ordering (SINO) to eliminate noise. The algorithm achieves about 20× speedup compared with a recent work using iterative deletion based global routing and simulated annealing based SINO. Furthermore, our algorithm increases the wire length by 4% compared with global routing without crosstalk constraints, achieving a 2.5× reduction compared with the aforementioned recent work.