Hua Xiang
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.
- R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows, Prentice Hall, 1993.Google Scholar
- T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms, The MIT Press, 1992. Google ScholarDigital Library
- T. Sakurai and k. Tamaru. Simple formulas for two and three dimensional capacitance. IEEE Trans. Electron Devices, 1993.Google Scholar
- H. Xiang, K. Chao, and D.F. Wong. ECO Algorithms for Removing Overlaps between Power Rails and Signal Wires, IEEE/ACM ICCAD, pp 67--74, San Jose, CA, Nov. 2002. Google ScholarDigital Library
- H. Zhou and D.F. Wong, Global Routing with Crosstalk Constraints, ACM/IEEE DAC, San Francisco, CA, 1998. Google ScholarDigital Library
Index Terms
- An ECO algorithm for eliminating crosstalk violations
Recommendations
X-architecture obstacles-avoiding routing with ECO consideration
ICC'10: Proceedings of the 14th WSEAS international conference on CircuitsIn the paper, we formulate a novel obstacle-avoiding engineering change ordering (ECO) driven minimal tree construction problem. The objective is to build a better routing tree in the sense of increasing ECO flexibility to force the routing tree pass ...
Crosstalk- and performance-driven multilevel full-chip routing
In this paper, we propose a novel framework for fast multilevel routing considering crosstalk and performance optimization. To handle the crosstalk minimization problem, we incorporate an intermediate stage of layer/track assignment into the multilevel ...
An ECO routing algorithm for eliminating coupling-capacitance violations
Engineering change order changes are almost inevitable in the late stages of a design process. Based on an existing design, incremental change is favored since it can avoid considerable efforts of redoing the whole process and can minimize the ...
Comments