Coupling aware routing
Ryan Kastner, Eli Bozorgzadeh, Majid Sarrafzadeh · 2002
In this paper, we develop methods to reduce interconnect delay and noise caused by coupling. First, we introduce two novel problems that deal with coupling-the Coupling-Free Routing (CFR) Problem and the Maximum Coupling-Free Layout (MAX-CFL) Problem. We argue that these problems are useful in both global and detailed routing. Then, we develop algorithms to efficiently solve the problems. Our experimental results show that the algorithms work effectively on real data.