Performance and RLC crosstalk driven global routing
Authors:
- Tong JingTJTong Jing
- Jinjun XiongJXJinjun Xiong
- Lei HeLHLei He
- 30 November 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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/spl times/ 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/spl times/ reduction compared with the aforementioned recent work.Keywords
This publication has 8 references indexed in Scilit:
- SSTT: Efficient local search for GSI global routingJournal of Computer Science and Technology, 2003
- A novel and efficient timing-driven global router for standard cell layout design based on critical network concept2003
- Post global routing RLC crosstalk budgeting2006 IEEE/ACM International Conference on Computer Aided Design, 2002
- An exact algorithm for coupling-free routing2001
- Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization2000
- Global routing with crosstalk constraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1999
- Post global routing crosstalk synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986