|
|
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 |
|
|
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.
|
Received: 24 June 2010
Published: 09 May 2011
|
|
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
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|