GDME : Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay

スポンサーリンク

概要

• 論文の詳細を見る

• This study has demonstrated that the clock tree construction in an SoC should be expanded to consider the intrinsic delay and skew of each IPs clock sink. A novel algorithm, called GDME, is proposed to combine grey relational clustering and DME approach for solving the problem of clock tree construction. Grey relational analysis can cluster the best pair of clock sinks and that guide a tapping point search for a DME algorithm for constructing a clock tree with zero skew and minimal delay. Experimentally, the proposed algorithm always obtains an RC-or RLC-based clock tree with zero skew and minimal delay for all the test cases and benchmarks. Experimental results demonstrate that the GDME improves up to 3.74% for total average in terms of total wire length compared with other DME algorithms. Furthermore, our results for the zero-skew RLC-based clock trees compared with Hspice are 0.017% and 0.2% lower for absolute average in terms of skew and delay, respectively.

• （社）電子情報通信学会の論文
• 2008-01-01

著者

• Lee Trong-yen

  Graduate Institute Of Computer And Communication National Taipei University Of Technology

• Tsai Chia-chun

  Dept. Of Computer Science And Information Eng. Nanhua University

• WU Jan-Ou

  Department of Electronic Engineering, De Lin Institute of Technology

• Wu Jan-ou

  Department Of Electronic Engineering De Lin Institute Of Technology

関連論文

• GDME : Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay
• Zero-Skew Driven Buffered RLC Clock Tree Construction(VLSI Design Technology and CAD)
• Post-Routing Double-Via Insertion for X-Architecture Clock Tree Yield Improvement

スポンサーリンク