首页> 外文会议> >Iterative convergence of optimal wire sizing and available buffer insertion for zero-skew clock tree optimization
【24h】

Iterative convergence of optimal wire sizing and available buffer insertion for zero-skew clock tree optimization

机译:最佳布线尺寸和可用缓冲区插入的迭代收敛,以实现零偏时钟树优化

获取原文

摘要

In This work, based on the topology of one DME-based zero-skew clock tree, the analysis of the optimal width of one wire segment and the information of available buffers on one wire segment, an iterative convergence-based algorithm is proposed to assign the optimal width and insert available buffers onto any wire segment to reduce the clock delay. The experimental results show that our proposed OWSABI algorithm reduces 78%/spl sim/88% clock delay and 20%/spl sim/28% total load capacitance in one DME-based zero-skew clock routing tree.
机译:在这项工作中,基于一个基于DME的零偏时钟树的拓扑,分析一个线段的最佳宽度以及一个线段上的可用缓冲区的信息,提出了一种基于迭代收敛的算法来分配最佳宽度,并在任何线段上插入可用的缓冲器,以减少时钟延迟。实验结果表明,我们提出的OWSABI算法在一棵基于DME的零偏时钟路由树中减少了78%/ spl sim / 88%的时钟延迟和20%/ spl sim / 28%的总负载电容。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号