26 March 2013 Computational solution of inverse directed self-assembly problem
Author Affiliations +
Abstract
Predicting directed self-assembly (DSA) patterns from given chemoepitaxy or graphoepitaxy directing patterns is a well known direct problem of computational DSA simulations. This paper concentrates on inverse problem of DSA – finding directing graphoepitaxy or chemoepitaxy patterns, resulting in given desired DSA patterns. Approaches to computational solution of inverse DSA problem are discussed, particularly the ones based on a linearization of the DSA model and minimizing the objective function ensuring the formation of the desired DSA patterns. We illustrate these approaches by presenting the results of their application to an inverse DSA problem for contact holes patterned using graphoepitaxy guiding templates.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Azat Latypov, Azat Latypov, } "Computational solution of inverse directed self-assembly problem", Proc. SPIE 8680, Alternative Lithographic Technologies V, 86800Z (26 March 2013); doi: 10.1117/12.2011575; https://doi.org/10.1117/12.2011575
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Inverse lithography using sparse mask representations
Proceedings of SPIE (March 17 2015)
A full-chip DSA correction framework
Proceedings of SPIE (March 27 2014)
Shape optimization for DSA
Proceedings of SPIE (March 21 2016)
Using heuristic optimization to set SRAF rules
Proceedings of SPIE (March 23 2017)

Back to Top