Layout Decomposition with Pairwise Coloring and Adaptive Multi-Start for Triple Patterning Lithography

In this article we present a pairwise coloring (PWC) approach to tackle the layout decomposition problem for triple patterning lithography (TPL). The main idea is to reduce the problem to a set of bi-coloring problems. The overall solution is refined by applying a bi-coloring method for pairs of color sets per pass. One obvious advantage of this method is that the existing double patterning lithography (DPL) techniques can be reused effortlessly. Moreover, we observe that each pass can be fulfilled efficiently by integrating an SPQR-tree-graph-division-based bi-coloring method. In addition, to prevent the solution getting stuck in the local minima, an adaptive multi-start (AMS) approach is incorporated. Adaptive starting points are generated according to the vote of previous solutions. The experimental results show that our method is competitive with other works on both solution quality and runtime performance.

[1]  Yao-Wen Chang,et al.  A novel layout decomposition algorithm for triple patterning lithography , 2012, DAC Design Automation Conference 2012.

[2]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[3]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .

[4]  Andrew B. Kahng,et al.  Layout decomposition for double patterning lithography , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[5]  Andrew B. Kahng,et al.  Layout Decomposition Approaches for Double Patterning Lithography , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Yuelin Du,et al.  Constrained pattern assignment for standard cell based triple patterning lithography , 2013, 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[7]  Evangeline F. Y. Young,et al.  An efficient layout decomposition approach for Triple Patterning Lithography , 2013, 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC).

[8]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[9]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[10]  Yue Xu,et al.  A matching based decomposer for double patterning lithography , 2010, ISPD '10.

[11]  Yici Cai,et al.  SUALD: Spacing uniformity-aware layout decomposition in triple patterning lithography , 2013, International Symposium on Quality Electronic Design (ISQED).

[12]  Yinghai Lu,et al.  Post-routing layer assignment for double patterning , 2011, 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011).

[13]  Yici Cai,et al.  Fast and scalable parallel layout decomposition in double patterning lithography , 2014, Integr..

[14]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[15]  Puneet Gupta,et al.  Layout Decomposition and Legalization for Double-Patterning Technology , 2013, 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]  Kun Yuan,et al.  Double Patterning Layout Decomposition for Simultaneous Conflict and Stitch Minimization , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  J. Cong,et al.  Multiway partitioning with pairwise movement , 1998, ICCAD '98.

[19]  Andrew B. Kahng,et al.  Combining problem reduction and adaptive multistart: a new technique for superior iterative partitioning , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  David Z. Pan,et al.  A high-performance triple patterning layout decomposer with balanced density , 2013, 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[21]  Kun Yuan,et al.  Layout Decomposition for Triple Patterning Lithography , 2015, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[23]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[24]  Andrew B. Kahng,et al.  Fast and efficient phase conflict detection and correction in standard-cell layouts , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[25]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[26]  Wai-Shing Luk,et al.  Fast and lossless graph division method for layout decomposition using SPQR-tree , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

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

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

[29]  Puneet Gupta,et al.  A novel methodology for triple/multiple-patterning layout decomposition , 2012, Advanced Lithography.

[30]  Zigang Xiao,et al.  A polynomial time triple patterning algorithm for cell based row-structure layout , 2012, 2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[31]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[32]  Kun Yuan,et al.  A new graph-theoretic, multi-objective layout decomposition framework for Double Patterning Lithography , 2010, 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC).

[33]  David Z. Pan,et al.  Layout decomposition for quadruple patterning lithography and beyond , 2014, 2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC).