loading...
A New Flexible Algorithm for Random Yield Improvement
San Jose, California March 26-March 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISQED.2007.188th International Symposium on Qualit ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Subarna Sinha, Synopsys Inc., USA
Qing Su, Synopsys Inc., USA
Linni Wen, Synopsys Inc., USA
Frank Lee, Synopsys Inc., USA
Charles Chiang, Synopsys Inc., USA
Yi-Kan Cheng, TSMC, Taiwan
Jin-Lien Lin, TSMC, Taiwan
Yu-Chyi Harn, TSMC, Taiwan
This paper presents a new and improved solution for random yield improvement at the post-routing stage. The proposed solution is better suited for current processes, where a clustering effect has been observed resulting in differing particle densities in the metal and empty regions of the chip.

To account for this clustering effect, we introduce the concept of weighted critical area to serve as a proxy for random yield loss. A new algorithm for weighted critical area minimization is also introduced. Based on the user-specified particle densities, the proposed optimization solution is driven by the weighted critical area and dynamically selects the appropriate critical area reduction technique in each local region to guarantee a reduction of the weighted critical area in both the local region and the whole layer. This makes the algorithm flexible and readily applicable to different process lines. It consistently improves the random yield irrespective of the particle densities in the metal and empty regions of the chip.

Citation:
Subarna Sinha, Qing Su, Linni Wen, Frank Lee, Charles Chiang, Yi-Kan Cheng, Jin-Lien Lin, Yu-Chyi Harn, "A New Flexible Algorithm for Random Yield Improvement," isqed, pp.795-800, 8th International Symposium on Quality Electronic Design (ISQED'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.