Practical techniques to reduce skew and its variations in buffered clock networks

  • Authors:
  • G. Venkataraman;N. Jayakumar;J. Hu;P. Li;Sunil Khatri;Anand Rajaram;P. McGuinness;C. Alpert

  • Affiliations:
  • Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA;Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA;Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA;Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA;Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA;-;-;-

  • Venue:
  • ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clock skew is becoming increasingly difficult to control due to variations. Link based non-tree clock distribution is a cost-effective technique for reducing clock skew variations. However, previous works based on this technique were limited to unbuffered clock networks and neglected spatial correlations in the experimental validation. In this work, we overcome these shortcomings and make the link based non-tree approach feasible for realistic designs. The short circuit risk and multi-driver delay issues in buffered non-tree clock networks are investigated. Our approach is validated with SPICE based Monte Carlo simulations, considering spatial correlations among variations. The experimental results show that our approach can reduce the maximal skew by 47%, improve the skew yield from 15% to 73% on average with a decrease on the total wire and buffer capacitance.