Redundant-via enhanced maze routing for yield improvement
Redundant-via enhanced maze routing for yield improvement
复制标题
DOI：
10.1145/1120725.1120927
复制
发表时间：
2005-01
期刊：
影响因子：
--
通讯作者：
Gang Xu;Li-Da Huang;D. Pan;Martin D. F. Wong
中科院分区：
文献类型：
--
作者：
Gang Xu;Li-Da Huang;D. Pan;Martin D. F. Wong
冗余过孔插入是一种很好的解决方案，以减少过孔故障造成的成品率损失。然而，现有的方法都是在详细布线之后插入冗余过孔的布局后优化。在本文中，我们提出了第一个布线算法，考虑冗余过孔插入的可行性，在详细的布线阶段。我们的布线问题被制定为迷宫布线与冗余过孔的限制。该问题转化为多约束最短路问题，并采用拉格朗日松弛技术求解。实验结果表明，该算法可以找到比传统迷宫布线高得多的冗余过孔率。
Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via after detailed routing. In this paper, we propose the first routing algorithm that considers feasibility of redundant via insertion in the detailed routing stage. Our routing problem is formulated as maze routing with redundant via constraints. The problem is transformed to a multiple constraint shortest path problem, and solved by Lagrangian relaxation technique. Experimental results show that our algorithm can find routing layout with much higher rate of redundant via than conventional maze routing.