Fast Crosstalk Repair by Quick Timing Change Estimation

Post route crosstalk repair is a difficult process and often requires significant manual intervention. Since repairing crosstalk for one net may cause new timing violations on other nets, the repair process might not converge. This often makes automation process of crosstalk repair difficult. In this paper, we formulate crosstalk repair process as an integer linear programming (ILP). Then, we propose a fast and efficient heuristic algorithm that minimizes the number of repairs by quickly estimating and predicting new timing information to choose the best candidate. Our experiments with industrial designs have shown excellent crosstalk repair results without any manual intervention