An Effective Chemical Mechanical Polishing Fill Insertion Approach

To reduce chip-scale topography variation, dummy fill is commonly used to improve the layout density uniformity. Previous works either sought the most uniform density distribution or sought to minimize the inserted dummy fills while satisfying certain density uniformity constraint. However, due to more stringent manufacturing challenges, more criteria, like line deviation and outlier, emerge at newer technology nodes. This article presents a joint optimization scheme to consider variation, total fill, line deviation, outlier, overlap, and running time simultaneously. More specifically, first we decompose the rectilinear polygons and partition fillable regions into rectangles for easier processing. After decomposition, we insert dummy fills into the fillable rectangular regions optimizing the fill metrics simultaneously. We propose three approaches, Fast Median approach, LP approach, and Iterative approach, which are much faster with better quality, compared with the results of the top three contestants in the ICCAD Contest 2014.

[1]  Andrew B. Kahng,et al.  Area fill synthesis for uniform layout density , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  IV CyrilHöschl,et al.  Decomposition of binary images - A survey and comparison , 2012, Pattern Recognit..

[3]  Yici Cai,et al.  A new splitting graph construction algorithm for SIAR router , 2013, 2013 IEEE 10th International Conference on ASIC.

[4]  Nelson Felix,et al.  Predicting substrate-induced focus error , 2010 .

[5]  Stephane Durocher,et al.  Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number , 2012, COCOON.

[6]  A. Kahng,et al.  Performance-Aware CMP Fill Pattern Optimization , 2007 .

[7]  Evangeline F. Y. Young,et al.  An Effective Chemical Mechanical Polishing Filling Approach , 2015, 2015 IEEE Computer Society Annual Symposium on VLSI.

[8]  Hai Zhou,et al.  Efficient Approximation Algorithms for Chemical Mechanical Polishing Dummy Fill , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Jimmy J. M. Tan,et al.  Minimum partitioning simple rectilinear polygons in O(n log log n) - time , 1989, SCG '89.

[10]  Sartaj Sahni,et al.  Fast algorithm for polygon decomposition , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Andrew B. Kahng,et al.  Filling algorithms and analyses for layout density control , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Rasit Onur Topaloglu ICCAD-2014 CAD contest in design for manufacturability flow for advanced semiconductor nodes and benchmark suite , 2014, 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[13]  Puneet Gupta,et al.  Performance-impact limited area fill synthesis , 2003, DAC '03.

[14]  Kevin D. Gourley,et al.  A Polygon-to-Rectangle Conversion Algorithm , 1983, IEEE Computer Graphics and Applications.

[15]  Bei Yu,et al.  High Performance Dummy Fill Insertion With Coupling and Uniformity Constraints , 2015, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Hai Zhou,et al.  Parallel CAD: Algorithm Design and Programming Special Section Call for Papers TODAES: ACM Transactions on Design Automation of Electronic Systems , 2010 .

[17]  Hai Zhou,et al.  Layout decomposition with pairwise coloring for multiple patterning lithography , 2013, 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[18]  D. Boning,et al.  The physical and electrical effects of metal-fill patterning practices for oxide chemical-mechanical polishing processes , 1998 .

[19]  Andrew B. Kahng,et al.  Monte-Carlo algorithms for layout density control , 2000, ASP-DAC '00.

[20]  Ruiqi Tian,et al.  Reticle enhancement technology: implications and challenges for physical design , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[21]  Yu Chen,et al.  Performance-impact limited-area fill synthesis , 2003, SPIE Advanced Lithography.

[22]  Jack Sklansky,et al.  Minimal rectangular partitions of digitized blobs , 1984, Comput. Vis. Graph. Image Process..

[23]  I-Lun Tseng,et al.  An efficient algorithm for partitioning parameterized polygons into rectangles , 2006, GLSVLSI '06.