首页> 外文期刊>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems >YOR: a yield-optimizing routing algorithm by minimizing critical areas and vias
【24h】

YOR: a yield-optimizing routing algorithm by minimizing critical areas and vias

机译:YOR:通过最小化关键区域和通孔来优化良率的布线算法

获取原文
获取原文并翻译 | 示例

摘要

The author points out that the goal of a channel routing algorithm is to route all the nets with as few tracks as possible to minimize chip areas and achieve 100% connection. However, the manufacturing yield may not reach a satisfactory level if care is not taken to reduce critical areas which are susceptible to defects. These critical areas are caused by the highly compacted adjacent wires and vias in the routing region. A channel routing algorithm, the yield optimizing routing (YOR) algorithm, is presented to deal with this problem. It systematically eliminates critical areas by floating, burying, and bumping net segments as well as shifting vias. The YOR algorithm also minimizes the number of vias since vias in a chip will increase manufacturing complexity and hence degrade the yield. YOR has been implemented and applied to benchmark routing layouts in the literature. Experimental results show that large reduction in the number of critical areas and significant improvement in yield are achieved, particularly for practical size channels such as Deutsch's difficult problem.
机译:作者指出,通道路由算法的目标是对所有网络进行尽可能少的走线,以最大程度地减少芯片面积并实现100%连接。但是,如果不注意减少易受缺陷影响的关键区域,则成品率可能无法达到令人满意的水平。这些关键区域是由布线区域中高度紧密的相邻导线和过孔引起的。为了解决这个问题,提出了一种信道路由算法,即良率优化路由算法。它通过浮动,掩埋和碰撞网段以及移动过孔来系统地消除关键区域。由于芯片中的通孔会增加制造复杂性并因此降低成品率,因此YOR算法还可以最大程度地减少通孔的数量。在文献中,YOR已被实现并应用于基准路由布局。实验结果表明,尤其是对于实际规模的渠道(例如Deutsch的难题),可以大幅减少关键区域的数量并显着提高产量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号