An ECO Technique for Removing Crosstalk Violations in Clock Networks

Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix crosstalk violations in the clock tree by making minimal design changes and maintaining skew bounds. We propose a novel approach for making engineering change order (ECO) changes in the clock network to remove crosstalk violations. A two-pronged approach based on wire-translocation and rerouting is presented. Wire translocation, i.e., changing the track for a net to another free track with less crosstalk, eliminates a large percentage of removable violations. A linear time procedure to check if a violation is removable by translocation is developed. Next, an efficient rerouting method based on an incremental loci-finding algorithm is combined with linear time dynamic programming approach to eliminate the remaining crosstalk violations. Simulation results for randomly-generated clock tree of different sizes and benchmark circuits demonstrate the effectiveness of this approach

[1]  Ren-Song Tsay,et al.  An exact zero-skew clock routing algorithm , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Eby G. Friedman,et al.  Clock distribution networks in synchronous digital integrated circuits , 2001, Proc. IEEE.

[3]  Andrew B. Kahng,et al.  Practical Bounded-Skew Clock Routing , 1997, J. VLSI Signal Process..

[4]  Ieee Circuits,et al.  20th International Conference on VLSI Design : held jointly with 6th International Conference on Embedded Systems : proceedings : 6-10 January, 2007, Bangalore, India , 2007 .

[5]  Malgorzata Marek-Sadowska,et al.  Minimizing Inter-Clock Coupling Jitter , 2003, ISQED.

[6]  Sachin S. Sapatnekar,et al.  Hybrid structured clock network construction , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[7]  Andrew B. Kahng,et al.  Toward CAD-IP Reuse: The MARCO GSRC Bookshelf of Fundamental CAD Algorithms , 2002 .

[8]  Masato Edahiro,et al.  A Clustering-Based Optimization Algorithm in Zero-Skew Routings , 1993, 30th ACM/IEEE Design Automation Conference.

[9]  Jason Cong,et al.  Matching-based methods for high-performance clock routing , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Arvind Srinivasan,et al.  Clock routing for high-performance ICs , 1991, DAC '90.

[11]  Jason Cong,et al.  Incremental CAD , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[12]  Jan-Ming Ho,et al.  Zero skew clock net routing , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[13]  Hua Xiang,et al.  ECO algorithms for removing overlaps between power rails and signal wires , 2002, ICCAD 2002.

[14]  Jiang Hu,et al.  Reducing clock skew variability via cross links , 2004, Proceedings. 41st Design Automation Conference, 2004..

[15]  Malgorzata Marek-Sadowska,et al.  Crosstalk minimization for multiple clock tree routing , 2002 .

[16]  Martin D. F. Wong,et al.  An ECO algorithm for eliminating crosstalk violations , 2004, ISPD '04.