2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC) 2014
DOI: 10.1109/dac.2014.6881380
|View full text |Cite
|
Sign up to set email alerts
|

Layout decomposition for quadruple patterning lithography and beyond

Abstract: For next-generation technology nodes, multiple patterning lithography (MPL) has emerged as a key solution, e.g., triple patterning lithography (TPL) for 14/11nm, and quadruple patterning lithography (QPL) for sub-10nm. In this paper, we propose a generic and robust layout decomposition framework for QPL, which can be further extended to handle any general K-patterning lithography (K>4). Our framework is based on the semidefinite programming (SDP) formulation with novel coloring encoding. Meanwhile, we propose … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
5
2
1

Relationship

3
5

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…The basic idea is to formulate a vector programming problem by introducing a set of unit vectors. For example, in quadruple patterning, four vectors are introduced in the SDP formulation from [5]: (0, 0, 1), (0, 2…”
Section: Lele-type Mplmentioning
confidence: 99%
See 2 more Smart Citations
“…The basic idea is to formulate a vector programming problem by introducing a set of unit vectors. For example, in quadruple patterning, four vectors are introduced in the SDP formulation from [5]: (0, 0, 1), (0, 2…”
Section: Lele-type Mplmentioning
confidence: 99%
“…The generalized SDP formulation for k-patterning layout decomposition where k ≥ 4 is shown as follows [5],…”
Section: Figure 3: Vector Based Color Representationsmentioning
confidence: 99%
See 1 more Smart Citation
“…The first ILP formulation for TPL comes from Yu et al [63] and a semidefinite programming (SDP) based algorithm is proposed to achieve approximate results. The SDP formulation is further extended to handle arbitrary k-coloring problem [64], shown as (1). Here k equals to 3 for TPL and 4 for QPL.…”
Section: Mpl Layout Decompositionmentioning
confidence: 99%
“…The layout decomposition problem has been well studied. 4,[9][10][11][12][13][14][15] In addition, the related constraints have been considered in early physical design stages, like routing, 16,17 standard cell design, 18,19 and detailed placement. 19 However, only few attempts have been made to address the LELE-EC layout decomposition problem.…”
Section: Illustrates Anmentioning
confidence: 99%