GREMA: Graph reduction based efficient mask assignment for double patterning technology

Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the entire layout on each layer onto two masks. It assigns two features to different masks if their spacing is less than a predefined threshold. Besides, some features must be sliced and put onto two masks so that there would be a feasible solution for mask assignment. Such slicing will cause stitches that affect yield. So decomposer needs to minimize their number. In this paper, we formulate the DPT decomposition problem as a maximum cut problem. We propose an extremely efficient two-stage decomposition algorithm called GREMA. The first stage of GREMA generates a set of candidate stitches to ensure that feasible solutions exist for DPT decomposition. The second stage uses maximum cut to find the minimal set of stitches. Our decomposer is able to solve much larger realistic design problems. Experiments demonstrated that GREMA achieved great performance on resolving conflicts with greatly reduced runtime.

[1]  Leee/acm International Conference On Computer-aided Design Digest Of Technical Papers , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[2]  Chang-Moon Lim,et al.  Positive and negative tone double patterning lithography for 50nm flash memory , 2006, SPIE Advanced Lithography.

[3]  Vincent Wiaux,et al.  Application challenges with double patterning technology (DPT) beyond 45 nm , 2006, SPIE Photomask Technology.

[4]  Anton van Oosten,et al.  Pattern split rules! A feasibility study of rule based pitch decomposition for double patterning , 2007, SPIE Photomask Technology.

[5]  Vincent Wiaux,et al.  Double patterning design split implementation and validation for the 32nm node , 2007, SPIE Advanced Lithography.

[6]  Vincent Wiaux,et al.  Double pattern EDA solutions for 32nm HP and beyond , 2007, SPIE Advanced Lithography.

[7]  Patrick Jaenen,et al.  Pitch doubling through dual-patterning lithography challenges in integration and litho budgets , 2007, SPIE Advanced Lithography.

[8]  Yasutaka Morikawa,et al.  Decomposition difficulty analysis for double patterning and the impact on photomask manufacturability , 2008, SPIE Advanced Lithography.

[9]  Tsann-Bim Chiou,et al.  Development of layout split algorithms and printability evaluation for double patterning technology , 2008, SPIE Advanced Lithography.

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

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

[12]  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.

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