An ECO algorithm for eliminating crosstalk violations

Authors:
Hua Xiang;Kai-Yuan Chao;Martin D. F. Wong
Affiliations:
University of Illinois at Urbana-Champaign, IL and Cadence Design Systems Inc, San Jose, CA;Intel Corporation, Hillsboro, OR;University of Illinois at Urbana-Champaign, IL
Venue:
Proceedings of the 2004 international symposium on Physical design
Year:
2004

Citing 3
Cited 1

Introduction to algorithms

Introduction to algorithms
Global routing with crosstalk constraints

DAC '98 Proceedings of the 35th annual Design Automation Conference
ECO algorithms for removing overlaps between power rails and signal wires

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design

Efficient timing-driven incremental routing for VLSI circuits using DFS and localized slack-satisfaction computations

Proceedings of the conference on Design, automation and test in Europe: Proceedings

Quantified Score

Hi-index	0.00

Visualization

Abstract

ECO changes are almost inevitable in late stages of a design process. Based on an existing design, incremental change is favored since it can avoid considerable efforts of re-doing the whole process and can minimize the disturbance on the existing converged design. In this paper, we address the CVE (Crosstalk Violation Elimination) problem. Due to the changes in a multiple layer routing design, the total capacitive crosstalk on some signal wire segments on a layer may be larger than their allowable bounds after post-layout timing/noise analysis. The target is to find a new routing solution without crosstalk violations under certain constraints which help to keep the new design close to the original one. We propose a two-stage algorithm to solve CVE problems, and present optimization strategies to speed up the execution. Experimental results demonstrate the efficiency and effectiveness of our algorithm.