Clock routing for high-performance ICs

Routing techniques for optimizing clock signals in small-cell (e.g., standard-cell, sea-of-gate, etc.) application-specific ICs (ASICs) are addressed. In previously reported works, the routing of a clock net has been performed using ordinary global routing techniques based on a minimum spanning or minimal Steiner tree that have little understanding of clock-routing problems. The authors present a novel approach to the clock-routing that all but eliminates clock skew and yields excellent phase delay results for a wide range of chip sizes, net sizes (pin count), minimum feature sizes, and pin distributions on both randomly created and standard industrial benchmarks. For certain classes of pin distributions a decrease in skew with an increase in net size was proven theoretically and observed experimentally. A two to three order magnitude reduction in skew when compared to a minimum rectilinear spanning tree was observed.<<ETX>>

[1]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[2]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[3]  H. T. Kung,et al.  Synchronizing Large Systolic Arrays , 1982, Other Conferences.

[4]  R. J. Gal-Ezer,et al.  Synchronous Versus Asynchronous Computation In Very Large Scale Integrated (VLSI) Array Processors , 1982, Other Conferences.

[5]  Mark Horowitz,et al.  Signal Delay in RC Tree Networks , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Dejan Mijuskovic Clock distribution in application specific integrated circuits , 1987 .

[7]  S. Butler,et al.  High performance clock distribution for CMOS ASICs , 1989, 1989 Proceedings of the IEEE Custom Integrated Circuits Conference.

[8]  Parameswaran Ramanathan,et al.  A clock distribution scheme for nonsymmetric VLSI circuits , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.