首页> 外文会议>International Conference on Communications, Circuits and Systems and West Sino Exposition >TGSCO: an algorithm for topology generation of clock tree with skew constraint and optimization
【24h】

TGSCO: an algorithm for topology generation of clock tree with skew constraint and optimization

机译:TGSCO:具有偏斜约束和优化时钟树拓扑生成的算法

获取原文
获取外文期刊封面目录资料

摘要

In this paper, a new clock tree topology generation algorithm TGSCO is proposed for the clock routing. The optimization includes two parts: a constructive stage followed by local topology refinement. During clock tree construction, the skew relationship between clock sinks is considered. Appropriate adjustment to the topology can reduce the delay and skew further. Voronoi diagram is used to accelerate computing. Different from previous methods, our algorithm can produce a clock tree with both balanced topology and short wire length. The experimental results show that the algorithm can control the skew constraints effectively, reduce total wire length, and find an optimized clock tree.
机译:本文提出了一种新的时钟树拓扑生成算法TGSCO为时钟路由。优化包括两部分:建设性阶段,然后是本地拓扑细化。在时钟树施工期间,考虑时钟沉积之间的偏斜关系。对拓扑的适当调整可以减少延迟和偏斜。 Voronoi图用于加速计算。与以前的方法不同,我们的算法可以产生具有平衡拓扑结构和短线长度的时钟树。实验结果表明,该算法可以有效地控制偏斜约束,减少总线长度,找到优化的时钟树。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号