Hotspot-aware DSA Grouping and Mask Assignment

10/09/2017
by   Yasmine Badr, et al.
0

In Directed Self Assembly (DSA), poor printing of guiding templates can cause misassembly resulting in high defect probability. Therefore, hotspots should be avoided in the choice of the DSA groups. Accordingly, Directed Self-Assembly (DSA) technologies which use Multiple Patterning (MP) to print the guiding templates need to be aware of hotspots during the DSA grouping and MP Decomposition. In this paper, we present a hotspot-aware heuristic for DSA grouping and MP decomposition. Results show that that the proposed heuristic eliminates 78 hotspot-unaware grouping and decomposition algorithm. In comparison to the optimal solution using Integer Linear Programming, the proposed heuristic results in  24

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2020

Grouping headlines

In this work we deal with the problem of grouping in headlines of the ne...
research
03/10/2022

Algorithms for the Maximum Eulerian Cycle Decomposition Problem

Given an Eulerian graph G, in the Maximum Eulerian Cycle Decomposition p...
research
07/07/2021

A Heuristic for Direct Product Graph Decomposition

In this paper we describe a heuristic for decomposing a directed graph i...
research
11/19/2020

On the Request-Trip-Vehicle Assignment Problem

The request-trip-vehicle assignment problem is at the heart of popular d...
research
08/01/2013

Exact and Heuristic Methods for the Assembly Line Worker Assignment and Balancing Problem

In traditional assembly lines, it is reasonable to assume that task exec...
research
09/13/2018

Learning to Group and Label Fine-Grained Shape Components

A majority of stock 3D models in modern shape repositories are assembled...
research
11/30/2022

HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compression

Transformers have attained superior performance in natural language proc...

Please sign up or login with your details

Forgot password? Click here to reset