Conference Paper

Double patterning layout decomposition for simultaneous conflict and stitch minimization.

Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX, USA
DOI: 10.1145/1514932.1514958 Conference: Proceedings of the 2009 International Symposium on Physical Design, ISPD 2009, San Diego, California, USA, March 29 - April 1, 2009
Source: DBLP

ABSTRACT Double patterning lithography (DPL) is considered as a most likely solution for 32 nm/22 nm technology. In DPL, the layout patterns are decomposed into two masks (colors), and manufactured through two exposures and etch steps. If the spacing between two features (polygons) is less than certain minimum coloring distance, they have to be assigned opposite colors. However, a proper coloring is not always feasible because two neighboring patterns within the minimum distance may be in the same mask due to complex pattern configurations. In that case, a feature may need to be split into two parts to resolve the conflict, resulting in stitch insertion which causes yield loss due to overlay and line-end effect. While previous layout decomposition approaches perform coloring and splitting separately, in this paper, we propose a simultaneous conflict and stitch minimization algorithm with an integer linear programming (ILP) formulation. Since ILP is in class NP-hard, the algorithm includes three speed-up techniques: 1) grid merging; 2) independent component computation; and 3) layout partition. In addition, our algorithm can be extended to handle design rules such as overlap margin and minimum width for practical use as well as off-grid layout. Our approach can reduce 33% of stitches and remove conflicts by 87.6% compared with two phase greedy decomposition. Index Terms—Double patterning lithography, integer linear programming, layout decomposition.

0 Bookmarks
 · 
53 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: As the CMOS feature enters the era of extreme scaling (14nm, 11nm and beyond), manufacturability challenges are exacerbated. The nanopatterning through the 193nm lithography is being pushed to its limit, through double/triple or more general multiple patterning, while non-conventional lithography technologies such as extreme ultra-violet (EUV), e-beam direct-write (EBDW), and so on, still have grand challenges to be solved for their adoption into IC volume production. This tutorial will provide an overview of key overarching issues in nanometer IC design for manufacturability (DFM) with these emerging lithography technologies, from modeling, mask synthesis, to physical design and beyond.
    Proceedings of the International Conference on Computer-Aided Design; 11/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: In order for the semiconductor industry to continue to follow Moore's law, both designers and foundries needed to proceed to the 22nm nodes. However, this was stalled due to the delay of the deployment of Extreme Ultra-Violet (EUV) technologies. To counteract this delay, a new technology called Double Patterning Photolithography has emerged. This technology necessitates the effective automation of layout decomposition or splitting. In this paper, we propose a hashing mechanism that can be adopted as a basis for a rule-based splitting algorithm. Results have proven this mechanism as a valuable addition to the Double Patterning decomposition techniques. Our analysis and results show that this hashing technique has an approximately linear runtime.
    Microelectronics (ICM), 2010 International Conference on; 01/2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: In Double Patterning Lithography (DPL), conflict and stitch minimization are two main challenges. Post-routing mask decomposition algorithms [1--4] may not be enough to achieve high quality solution for DPL-unfriendly designs, due to complex metal patterns. In this paper, we propose an efficient framework of WISDOM to perform wire spreading and mask assignment simultaneously for enhanced decomposability. A set of Wire Spreading Candidates (WSC) are identified to eliminate coloring constraints or create additional splitting locations. Based on these candidates, an Integer Linear Programming (ILP) formulation is proposed to simultaneously minimize the number of conflicts and stitches, while introducing as less layout perturbation as possible. To improve scalability, we further propose three acceleration techniques without loss of solution quality: odd-cycle union optimization, coloring-independent group computing, and suboptimal solution pruning. The experimental results show that, compared to a postrouting mask decomposition method [2], we are able to reduce the number of conflicts and stitches by 41% and 23% respectively, with only 0.43% wire length increase. Moreover, with proposed acceleration methods, we achieve 9x speed-up.
    Proceedings of the International Conference on Computer-Aided Design; 11/2010

Full-text

Download
0 Downloads
Available from