Accuracy vs. complexity: OPC solutions and tradeoffs

被引:0
|
作者
Balasinski, A [1 ]
Iandolo, W [1 ]
Banachowicz, B [1 ]
Staud, W [1 ]
Ma, M [1 ]
Sweis, J [1 ]
机构
[1] Cypress Semicond Inc, San Jose, CA 95134 USA
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Evolution of Optical Proximity Correction (OPC) methodology with the continuing shrink of feature size indicates a gradual shift towards increasingly more complex solutions, i.e., from rule based to model based OPC. The key underlying reason is to provide adequate accuracy of pattern reproduction despite the growing sub-wavelength gap, i.e., the difference between minimum feature size and the wavelength used to print it [1]. However, full chip implementation of these complex solutions would increase CAD flow/mask generation runtimes and database file sizes, therefore compromising reticle manufacturability. In order to select optimal OPC routines based on feedback from process, CAD, design, and mask,engineering, we proposed a methodology and investigated tradeoffs between correction accuracy and database complexity. Rule-based OPC, i.e., corrections defined by a set of width and spacing proximity rules rely on a limited set of test geometries and can't be made sensitive to the environment of the feature. In contrast, model based OPC features are generated for the actual layout environment and can be changed depending on the adopted photolithography process. Another degree of freedom is provided by the rule or model calibration. We defined and discussed complexity and accuracy criteria such as the size of the database and the number of silicon imaging errors.
引用
收藏
页码:32 / 41
页数:10
相关论文
共 50 条
  • [1] Diagnosing diabetes: Cutoffs vs. tradeoffs
    Davidson, MB
    [J]. ENDOCRINOLOGIST, 2000, 10 (02): : 90 - 96
  • [2] Complexity vs. diversity
    Pronger, Greg
    [J]. SCIENTIST, 2009, 23 (03): : 16 - 16
  • [3] Complexity vs. demagogy
    不详
    [J]. OIL & GAS JOURNAL, 2011, 109 (13) : 24 - 24
  • [4] Complexity accuracy tradeoffs of Lie operators in motion estimation
    Pan, W. David
    Yoo, Seong-Moo
    Park, Chul-Ho
    [J]. PATTERN RECOGNITION LETTERS, 2007, 28 (07) : 778 - 787
  • [5] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    [J]. COMPUTATIONAL COMPLEXITY, 2008, 17 (01) : 70 - 93
  • [6] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 426 - 437
  • [7] Learning complexity vs. communication complexity
    Linial, Nati
    Shraibman, Adi
    [J]. TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 53 - 63
  • [8] Space Complexity Vs. Query Complexity
    Oded Lachish
    Ilan Newman
    Asaf Shapira
    [J]. computational complexity, 2008, 17 : 70 - 93
  • [9] Bondpad Design Structural vs. Electrical Tradeoffs
    Williams, Brett
    Davis, Robert
    Yerger, Justin
    Allman, Derryl
    Greenwood, Bruce
    Ruud, Troy
    [J]. 2020 31ST ANNUAL SEMI ADVANCED SEMICONDUCTOR MANUFACTURING CONFERENCE (ASMC), 2020,
  • [10] 'Accuracy' vs. 'speed'
    Alterman, E
    [J]. NATION, 2000, 271 (19) : 10 - 10