2022 International Workshop on Advanced Patterning Solutions (IWAPS) 2022
DOI: 10.1109/iwaps57146.2022.9972300
|View full text |Cite
|
Sign up to set email alerts
|

A Generation solving Layout Decomposition Method for DSA-MP Hybrid Lithography

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…As for graph-based approaches, Zhang et al proposed a weighted generational solving algorithm based on graph growing and a specific backtracking strategy to solve the simultaneous template optimization and mask assignment problem. 7 Badr et al proposed a two-stage heuristic method that scales to dense full-chip designs. 8 They assumed that maximizing the chance of grouping can maximize the possibility of being able to fix conflicts by DSA grouping.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…As for graph-based approaches, Zhang et al proposed a weighted generational solving algorithm based on graph growing and a specific backtracking strategy to solve the simultaneous template optimization and mask assignment problem. 7 Badr et al proposed a two-stage heuristic method that scales to dense full-chip designs. 8 They assumed that maximizing the chance of grouping can maximize the possibility of being able to fix conflicts by DSA grouping.…”
Section: Introductionmentioning
confidence: 99%
“…As for graph-based approaches, Zhang et al. proposed a weighted generational solving algorithm based on graph growing and a specific backtracking strategy to solve the simultaneous template optimization and mask assignment problem 7 . Badr et al.…”
Section: Introductionmentioning
confidence: 99%