【24h】

BCDRouter: global routing considering CMP and via reduction

机译:BCDRouter:考虑CMP和通过减少的全局路由

获取原文

摘要

Chemical-mechanical polishing (CMP) is one of the fundamental problems that should be considered for improving design for manufacturability (DFM) in routing. This paper presents a global routing algorithm,which is BCDRouter,to consider CMP. The algorithm uses the routing density of GRC to simulate the density of CMP,and reduces routing and congestion densities simultaneously. This will make the continuous CMP plainer. So that DFM,reliability and yield can be improved. The experimental results show that the algorithm is effective in reducing maximum GRC congestion and congestion variance.
机译:化学机械抛光(CMP)是改善布线中可制造性(DFM)设计时应考虑的基本问题之一。本文提出了一种考虑CMP的全局路由算法BCDRouter。该算法利用GRC的路由密度来模拟CMP的密度,同时降低路由和拥塞密度。这将使连续CMP变得更加简单。这样可以提高DFM,可靠性和良率。实验结果表明,该算法在减少最大GRC拥塞和拥塞方差方面是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号