【24h】

Layer Assignment for Yield Enhancement

机译:图层分配以提高产量

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

摘要

In this paper, two algorithms for layer assignment with the goal of yield enhancement are proposed. In the first, vias in an existing layout are moved in order to decrease its sensitivity to defects. A greedy algorithm for achieving this objective is presented. In the second, we formulate the layer assignment problem as a network bipartitioning problem. By applying the primal-dual algorithm[1] (a variation of the Kernighan-Lin algorithm[2]), the objective of critical area minimization can be achieved. These two methods are applied to a set of benchmark circuits to demonstrate their effectiveness.
机译:本文提出了两种以提高产量为目标的层分配算法。首先,移动现有布局中的通孔以降低其对缺陷的敏感性。提出了一种用于实现该目标的贪婪算法。在第二篇中,我们将层分配问题表述为网络划分问题。通过应用对偶算法[1](Kernighan-Lin算法的一种[2]),可以实现临界面积最小化的目标。将这两种方法应用于一组基准电路以证明其有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号