16 March 2016 Triple/quadruple patterning layout decomposition via novel linear programming and iterative rounding
Author Affiliations +
Abstract
As feature size of the semiconductor technology scales down to 10nm and beyond, multiple patterning lithography (MPL) has become one of the most practical candidates for lithography, along with other emerging technologies such as extreme ultraviolet lithography (EUVL), e-beam lithography (EBL) and directed self assembly (DSA). Due to the delay of EUVL and EBL, triple and even quadruple patterning are considered to be used for lower metal and contact layers with tight pitches. In the process of MPL, layout decomposition is the key design stage, where a layout is split into various parts and each part is manufactured through a separate mask. For metal layers, stitching may be allowed to resolve conflicts, while it is forbidden for contact and via layers.

In this paper, we focus on the application of layout decomposition where stitching is not allowed such as for contact and via layers. We propose a linear programming and iterative rounding (LPIR) solving technique to reduce the number of non-integers in the LP relaxation problem. Experimental results show that the proposed algorithms can provide high quality decomposition solutions efficiently while introducing as few conflicts as possible.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yibo Lin, Xiaoqing Xu, Bei Yu, Ross Baldick, David Z. Pan, "Triple/quadruple patterning layout decomposition via novel linear programming and iterative rounding", Proc. SPIE 9781, Design-Process-Technology Co-optimization for Manufacturability X, 97810M (16 March 2016); doi: 10.1117/12.2218628; https://doi.org/10.1117/12.2218628
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT


Back to Top