10.1631/jzus.C10e0219," /> 10.1631/jzus.C10e0219,"/> 10.1631/jzus.C10e0219,"/> A sparse matrix model-based optical proximity correction algorithm with model-based mapping between segments and control sites
Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2011, Vol. 12 Issue (5): 436-442    DOI: 10.1631/jzus.C1000219
    
A sparse matrix model-based optical proximity correction algorithm with model-based mapping between segments and control sites
Bin Lin*, Xiao-lang Yan, Zheng Shi, Yi-wei Yang
Institute of VLSI Design, Zhejiang University, Hangzhou 310027, China
Download:   PDF(469KB)
Export: BibTeX | EndNote (RIS)      

Abstract  Optical proximity correction (OPC) is a key step in modern integrated circuit (IC) manufacturing. The quality of model-based OPC (MB-OPC) is directly determined by segment offsets after OPC processing. However, in conventional MB-OPC, the intensity of a control site is adjusted only by the movement of its corresponding segment; this scheme is no longer accurate enough as the lithography process advances. On the other hand, matrix MB-OPC is too time-consuming to become practical. In this paper, we propose a new sparse matrix MB-OPC algorithm with model-based mapping between segments and control sites. We put forward the concept of ‘sensitive area’. When the Jacobian matrix used in the matrix MB-OPC is evaluated, only the elements that correspond to the segments in the sensitive area of every control site need to be calculated, while the others can be set to 0. The new algorithm can effectively improve the sparsity of the Jacobian matrix, and hence reduce the computations. Both theoretical analysis and experiments show that the sparse matrix MB-OPC with model-based mapping is more accurate than conventional MB-OPC, and much faster than matrix MB-OPC while maintaining high accuracy.

Key wordsMatrix sparsity      Optical proximity correction (OPC)      Convergence      Segment      10.1631/jzus.C10e0219')" href="#">Sensitive area

An erratum to this article can be found at doi:10.1631/jzus.C10e0219     
Received: 24 June 2010      Published: 09 May 2011
CLC:  TN47  
Service
E-mail this article 10.1631/jzus.C10e0219”. Please open it by linking:http://www.zjujournals.com/xueshu/fitee/EN/abstract/abstract14985.shtml" name="neirong"> 10.1631/jzus.C10e0219">
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Bin Lin
Xiao-lang Yan
Zheng Shi
Yi-wei Yang
Cite this article:

Bin Lin, Xiao-lang Yan, Zheng Shi, Yi-wei Yang. A sparse matrix model-based optical proximity correction algorithm with model-based mapping between segments and control sites. Front. Inform. Technol. Electron. Eng., 2011, 12(5): 436-442.

URL:

http://www.zjujournals.com/xueshu/fitee/10.1631/jzus.C1000219     OR     http://www.zjujournals.com/xueshu/fitee/Y2011/V12/I5/436


A sparse matrix model-based optical proximity correction algorithm with model-based mapping between segments and control sites

Optical proximity correction (OPC) is a key step in modern integrated circuit (IC) manufacturing. The quality of model-based OPC (MB-OPC) is directly determined by segment offsets after OPC processing. However, in conventional MB-OPC, the intensity of a control site is adjusted only by the movement of its corresponding segment; this scheme is no longer accurate enough as the lithography process advances. On the other hand, matrix MB-OPC is too time-consuming to become practical. In this paper, we propose a new sparse matrix MB-OPC algorithm with model-based mapping between segments and control sites. We put forward the concept of ‘sensitive area’. When the Jacobian matrix used in the matrix MB-OPC is evaluated, only the elements that correspond to the segments in the sensitive area of every control site need to be calculated, while the others can be set to 0. The new algorithm can effectively improve the sparsity of the Jacobian matrix, and hence reduce the computations. Both theoretical analysis and experiments show that the sparse matrix MB-OPC with model-based mapping is more accurate than conventional MB-OPC, and much faster than matrix MB-OPC while maintaining high accuracy.

关键词: Matrix sparsity,  Optical proximity correction (OPC),  Convergence,  Segment,  Sensitive area

An erratum to this article can be found at doi:10.1631/jzus.C10e0219 
[1] T T DHIVYAPRABHA, P SUBASHINI, M KRISHNAVENI. Synergistic fibroblast optimization: a novel nature-inspired computing algorithm #br#  [J]. Front. Inform. Technol. Electron. Eng., 2018, 19(7): 815-833.
[2] Ji-jun TONG, Peng ZHANG , Yu-xiang WENG , Dan-hua ZHU. Kernel sparse representation for MRI image analysis in automatic brain tumor segmentation[J]. Front. Inform. Technol. Electron. Eng., 2018, 19(4): 471-480.
[3] Jin ZHANG , Zhao-hui TANG , Wei-hua GUI , Qing CHEN , Jin-ping LIU. Interactive image segmentation with a regression based ensemble learning paradigm[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(7): 1002-1020.
[4] Jia-yin Song, Wen-long Song, Jian-ping Huang, Liang-kuan Zhu. Segmentation and focus-point location based on boundary analysis in forest canopy hemispherical photography[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(8): 741-749.
[5] Hong Yin, Shu-qiang Yang, Xiao-qian Zhu, Shao-dong Ma, Lu-min Zhang. Symbolic representation based on trend features for knowledge discovery in long time series[J]. Front. Inform. Technol. Electron. Eng., 2015, 16(9): 744-758.
[6] De-xuan Zou, Li-qun Gao, Steven Li. Volterra filter modeling of a nonlinear discrete-time system based on a ranked differential evolution algorithm[J]. Front. Inform. Technol. Electron. Eng., 2014, 15(8): 687-696.
[7] Xian Zang, Felipe P. Vista Iv, Kil To Chong. Fast global kernel fuzzy c-means clustering algorithm for consonant/vowel segmentation of speech signal[J]. Front. Inform. Technol. Electron. Eng., 2014, 15(7): 551-563.
[8] Xin Hao, Ye Shen, Shun-ren Xia. Automatic mass segmentation on mammograms combining random walks and active contour[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(9): 635-648.
[9] Yan Liu, Jie Yang, Long Li, Wei Wu. Negative effects of sufficiently small initial weights on back-propagation neural networks[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(8): 585-592.
[10] Jamal Ghasemi, Mohammad Reza Karami Mollaei, Reza Ghaderi, Ali Hojjatoleslami. Brain tissue segmentation based on spatial information fusion by Dempster-Shafer theory[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(7): 520-533.
[11] Shi-yan Wang, Hui-min Yu. Convex relaxation for a 3D spatiotemporal segmentation model using the primal-dual method[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(6): 428-439.
[12] Yu Zhou, An-wen Shen, Jin-bang Xu. Non-interactive automatic video segmentation of moving targets[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(10): 736-749.
[13] Wen-fei WANG, Rong XIONG, Jian CHU. Map building for dynamic environments using grid vectors[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(7): 574-588.
[14] Lei Yan, Cheol-Woo Park, Sang-Ryong Lee, Choon-Young Lee. New separation algorithm for touching grain kernels based on contour segments and ellipse fitting[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(1): 54-61.