Dr. Daifeng Guo Profile

Dr. Daifeng Guo

SPIE Involvement:

Author

Publications (2)

Proceedings Article | 28 March 2017 Presentation + Paper

Density driven placement of sub-DSA resolution assistant features (SDRAFs)

Daifeng Guo, Maryann Tung, Ioannis Karageorgos, H.-S. Philip Wong, Martin D. Wong

Proceedings Volume 10148, 101480E (2017) https://doi.org/10.1117/12.2257954

KEYWORDS: Directed self assembly, Algorithms, Electron beam lithography, Extreme ultraviolet lithography, Lithography, Mirrors, Semiconducting wafers, Polymers, Optical lithography, Manufacturing

Read Abstract +

Proceedings Article | 23 October 2015 Paper

Model-based multiple patterning layout decomposition

Daifeng Guo, Haitong Tian, Yuelin Du, Martin D. Wong

Proceedings Volume 9635, 963522 (2015) https://doi.org/10.1117/12.2197852

KEYWORDS: Model-based design, Lithography, Photomasks, Computer simulations, Optical lithography, Optical simulations, Double patterning technology, Algorithms, Electron beam lithography, Optimization (mathematics)

Read Abstract +

As one of the most promising next generation lithography technologies, multiple patterning lithography (MPL) plays an important role in the attempts to keep in pace with 10 nm technology node and beyond. With feature size keeps shrinking, it has become impossible to print dense layouts within one single exposure. As a result, MPL such as double patterning lithography (DPL) and triple patterning lithography (TPL) has been widely adopted. There is a large volume of literature on DPL/TPL layout decomposition, and the current approach is to formulate the problem as a classical graph-coloring problem: Layout features (polygons) are represented by vertices in a graph G and there is an edge between two vertices if and only if the distance between the two corresponding features are less than a minimum distance threshold value d_min. The problem is to color the vertices of G using k colors (k = 2 for DPL, k = 3 for TPL) such that no two vertices connected by an edge are given the same color. This is a rule-based approach, which impose a geometric distance as a minimum constraint to simply decompose polygons within the distance into different masks. It is not desired in practice because this criteria cannot completely capture the behavior of the optics. For example, it lacks of sufficient information such as the optical source characteristics and the effects between the polygons outside the minimum distance. To remedy the deficiency, a model-based layout decomposition approach to make the decomposition criteria base on simulation results was first introduced at SPIE 2013.¹ However, the algorithm¹ is based on simplified assumption on the optical simulation model and therefore its usage on real layouts is limited. Recently AMSL² also proposed a model-based approach to layout decomposition by iteratively simulating the layout, which requires excessive computational resource and may lead to sub-optimal solutions. The approach² also potentially generates too many stiches. In this paper, we propose a model-based MPL layout decomposition method using a pre-simulated library of frequent layout patterns. Instead of using the graph G in the standard graph-coloring formulation, we build an expanded graph H where each vertex represents a group of adjacent features together with a coloring solution. By utilizing the library and running sophisticated graph algorithms on H, our approach can obtain optimal decomposition results efficiently. Our model-based solution can achieve a practical mask design which significantly improves the lithography quality on the wafer compared to the rule based decomposition.

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Keywords/Phrases

Search In:

Publication Years