27 March 2007 A feasible model-based OPC algorithm using Jacobian matrix of intensity distribution functions
Author Affiliations +
Abstract
The correction accuracy of a model-based OPC (MB-OPC) depends critically on its edge offset calculation scheme. In a normal MB-OPC algorithm, only the impact of the current edge is considered in calculating each edge offset. As the k1 process factor decreases and design complexity increases, however, the interaction between the edge segments becomes much larger. As a result, the normal MB-OPC algorithm may not always converge or converge slowly. Controlling the EPE is thus become harder. To address this issue, a new kind of MB-OPC algorithm based on MEEF matrix was introduced which is also called matrix OPC. In this paper, a variant of such matrix OPC algorithm is proposed which is suitable for kernel-based lithography models. Comparing with that based on MEEF matrix, this algorithm requires less computation in matrix construction. Sparsity control scheme and RT reuse scheme are also used to make the correction speed be close to a normal one while keeping its advantages on EPE control.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ye Chen, Kechih Wu, Zheng Shi, Xiaolang Yan, "A feasible model-based OPC algorithm using Jacobian matrix of intensity distribution functions", Proc. SPIE 6520, Optical Microlithography XX, 65204C (27 March 2007); doi: 10.1117/12.711763; https://doi.org/10.1117/12.711763
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Cross-MEEF assisted SRAF print avoidance approach
Proceedings of SPIE (March 20 2018)
Fast dual graph-based hotspot detection
Proceedings of SPIE (October 20 2006)
New mask technology challenges
Proceedings of SPIE (September 05 2001)
Controlling defocus impact on OPC performance
Proceedings of SPIE (August 28 2003)

Back to Top