Enhanced Double Via Insertion Using Wire Bending

Redundant via insertion is highly recommended for improving chip yield and reliability. In this paper, we studied the problem of simultaneous double via insertion and wire bending (DVI/WB) in a postrouting stage, where a single via can have at most one redundant via inserted next to it. Aside from this, we are allowed to bend existing signal wires for enhancing the insertion rate of double vias. The primary goal of the DVI/WB problem is to insert as many double vias as possible; the secondary objective is to minimize the amount of layout perturbation. We formulate the DVI/WB problem as that of finding a minimum-weight maximum independent set (mWMIS) on an enhanced conflict graph. We proposed algorithms to perform wire bending and to construct the enhanced conflict graph from a given design. We also proposed a zero-one integer linear program (0-1 ILP)-based approach to solve the mWMIS problem. Moreover, we studied the problem of DVI/WB with the consideration of via density and extended our 0-1 ILP-based approach to solve it. Experimental results show that our approaches can improve the insertion rate by up to 6.34% at the expense of up to 1.29% wirelength increase when compared with the state-of-the-art double via insertion methods that do not consider wire bending. Moreover, when compared with an existing method that considers wire bending, our DVI/WB approach can insert 2% more double vias and produce 32% less wirelength increase rate on average.

[1]  Yao-Wen Chang,et al.  Full-Chip Routing Considering Double-Via Insertion , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[3]  Kuang-Yao Lee,et al.  Post-routing redundant via insertion for yield/reliability improvement , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[4]  Kamal Rajkanan Yield analysis methodology for low defectivity wafer fabs , 2000, Records of the IEEE International Workshop on Memory Technology, Design and Testing.

[5]  Wayne Wei-Ming Dai,et al.  Yield-preferred via insertion based on novel geotopological technology , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[6]  Yu-Min Lee,et al.  Post-routing redundant via insertion with wire spreading capability , 2009, 2009 Asia and South Pacific Design Automation Conference.

[7]  Neil Harrison A simple via duplication tool for yield enhancement , 2001, Proceedings 2001 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems.

[8]  Cheng-Kok Koh,et al.  Fast and Optimal Redundant Via Insertion , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[10]  Gang Xu,et al.  Redundant-via enhanced maze routing for yield improvement , 2005, ASP-DAC.

[11]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[12]  Martin D. F. Wong,et al.  Is your layout density verification exact?: a fast exact algorithm for density calculation , 2007, ISPD '07.

[13]  Kevin McCullen,et al.  Redundant Via Insertion in Restricted Topology Layouts , 2007, 8th International Symposium on Quality Electronic Design (ISQED'07).

[14]  Martin D. F. Wong,et al.  Is Your Layout-Density Verification Exact?—A Fast Exact Deep Submicrometer Density Calculation Algorithm , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Ting-Chi Wang,et al.  Post-Routing Redundant Via Insertion and Line End Extension with Via Density Consideration , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[16]  Yici Cai,et al.  Improved multilevel routing with redundant via placement for yield and reliability , 2005, GLSVLSI '05.