A single layer zero skew clock routing in X architecture

With its advantages in wirelength reduction and routing flexibility compared with conventional Manhattan routing, X architecture has been proposed and applied to modern IC design. As a critical part in high-performance integrated circuits, clock network design meets great challenges due to feature size decrease and clock frequency increase. In order to eliminate the delay and attenuation of clock signal introduced by the vias, and to make it more tolerant to process variations, in this paper, we propose an algorithm of a single layer zero skew clock routing in X architecture (called Planar-CRX). Our Planar-CRX method integrates the extended deferred-merge embedding algorithm (DME-X, which extends the DME algorithm to X architecture) with modified Ohtsuki’s line-search algorithm to minimize the total wirelength and the bends. Compared with planar clock routing in the Manhattan plane, our method achieves a reduction of 6.81% in total wirelength on average and gets the resultant clock tree with fewer bends. Experimental results also indicate that our solution can be comparable with previous non-planar zero skew clock routing algorithm.

[1]  Cheng-Kok Koh,et al.  UST/DME: a clock tree router for general skew constraints , 2000, TODE.

[2]  Jan-Ming Ho,et al.  Zero skew clock routing with minimum wirelength , 1992 .

[3]  R. Tsay Exact zero skew , 1991, ICCAD 1991.

[4]  Cheng-Kok Koh,et al.  UST/DME: a clock tree router for general skew constraints , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

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

[6]  Yici Cai,et al.  High performance clock routing in X-architecture , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[7]  Rupesh S. Shelar An efficent clustering algorithm for low power clock tree synthesis , 2007, ISPD '07.

[8]  T. Ohtsuki,et al.  Layout design and verification , 1986 .

[9]  Wei Li,et al.  Buffer insertion for clock delay and skew minimization , 1999, ISPD '99.

[10]  Jason Cong,et al.  Minimum-cost bounded-skew clock routing , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[11]  Lawrence T. Pileggi,et al.  Clustering and load balancing for buffered clock tree synthesis , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[12]  Steve Teig Session details: The X Architecture: Not your father's diagonal wiring , 2002, SLIP '02.

[13]  Andrew B. Kahng,et al.  Planar-DME: a single-layer zero-skew clock tree router , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Dian Zhou,et al.  Efficient implementation of a planar clock routing with thetreatment of obstacles , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Andrew B. Kahng,et al.  Power-aware placement , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[16]  Yao-Wen Chang,et al.  Multilevel full-chip routing for the X-based architecture , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[17]  E. Kuh,et al.  Clock routing for high-performance ICs , 1990, 27th ACM/IEEE Design Automation Conference.

[18]  Qing Zhu,et al.  Planar clock routing for high performance chip and package co-design , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[19]  Yi Liu,et al.  Reliable buffered clock tree routing algorithm with process variation tolerance , 2005, Science in China Series F: Information Sciences.