TROY: Track Router with Yield-driven Wire Planning

In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed from critical area analysis and defect size distribution strongly depends on wire ordering, sizing, and spacing, track routing plays a key role in effective wire planning for yield optimization. TROY formulates wire ordering into a preference-aware minimum Hamiltonian path problem. For simultaneous wire sizing and spacing optimization, TROY solves it optimally by formulating the problems into a second order conic programming (SOCP). Experimental results show that TROY can reduce the random-defect yield loss by 18% on average without any overhead in wirelength, compared with the widely used greedy approach.

[1]  Min Zhao,et al.  Timing driven track routing considering coupling capacitance , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..

[2]  Hua Xue,et al.  Routing for reliable manufacturing , 1995 .

[3]  Joseph Y.-T. Leung,et al.  An Optimal Solution for the Channel-Assignment Problem , 1979, IEEE Transactions on Computers.

[4]  I. Koren,et al.  Layout-synthesis techniques for yield enhancement , 1995 .

[5]  Dirk Müller,et al.  Optimizing yield in global routing , 2006, ICCAD '06.

[6]  Wayne Wei-Ming Dai,et al.  Post-route optimization for improved yield using a rubber-band wiring model , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[7]  Feng Zhou,et al.  Refined single trunk tree: a rectilinear steiner tree generator for interconnect prediction , 2002, SLIP '02.

[8]  Ting-Mao Chang,et al.  YOR: A yield optimizing routing algorithm by minimizing critical areas and vias , 1991 .

[9]  D. T. Lee,et al.  Critical area computation via Voronoi diagrams , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Israel Koren,et al.  Should yield be a design objective? , 2000, Proceedings IEEE 2000 First International Symposium on Quality Electronic Design (Cat. No. PR00525).

[11]  Wojciech Maly,et al.  Modeling of Lithography Related Yield Losses for CAD of VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Duncan M. Walker.  Yield simulation for integrated circuits , 1987 .

[13]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[14]  G. A. Allan,et al.  Targeted layout modifications for semiconductor yield/reliability enhancement , 2004, IEEE Transactions on Semiconductor Manufacturing.

[15]  Cyrus Bamji,et al.  Enhanced network flow algorithm for yield optimization , 1996, DAC '96.

[16]  R. Glang,et al.  Defect size distribution in VLSI chips , 1990, International Conference on Microelectronic Test Structures.

[17]  Carl Sechen,et al.  Timing and crosstalk driven area routing , 1998, DAC.

[18]  Phillip Christie,et al.  Prelayout interconnect yield prediction , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[19]  Suchai Thanawastien,et al.  DTR: A Defect-Tolerant Routing Algorithm , 1989, 26th ACM/IEEE Design Automation Conference.

[20]  C.-J. Richard Shi,et al.  Layout compaction for yield optimization via critical area minimization , 2000, DATE '00.

[21]  Makoto Ikeda,et al.  Exact wiring fault minimization via comprehensive layout synthesis for CMOS logic cells , 2004, International Symposium on Signals, Circuits and Systems. Proceedings, SCS 2003. (Cat. No.03EX720).

[22]  Hai Zhou,et al.  Track assignment: a desirable intermediate step between global routing and detailed routing , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..