中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/103789
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81545570      Online Users : 3984
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/103789


    Title: Native-conflict and stitch-aware wire perturbation for double patterning technology
    Authors: 陳思妤;Fang, Shao-Yun;Chen, Szu-Yu;Chang, Yao-Wen
    Contributors: 理學院光電科學與工程學系
    Keywords: Algorithms;Color;Compaction;Decomposition;Design engineering;double patterning technology;Insertion;Layout;lithography;Minimization;native conflict;Patterning;Perturbation methods;Prediction algorithms;Prediction methods;stitch minimization;Stitches;Studies;Wire;wire perturbation;Wires
    Date: 2012-05-01
    Issue Date: 2026-04-23 11:37:37 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
    Abstract: 摘要: Double patterning technology (DPT), in which a dense layout pattern is decomposed into two separate masks to relax its pitch, is the most popular lithography solution for the sub-22 nm node to enhance pattern printability. Previous work focused on stitch insertion to improve the decomposition success rate. However, there exist native conflicts (NCs) which cannot be resolved by any kind of stitch insertion. A design with NCs is not DPT-compliant and may fail the decomposition, resulting in design for manufacturability redesign and longer design cycles. In this paper, we give a sufficient condition for the NC existence and propose a geometry-based method for NC prediction to develop an early-stage analyzer for DPT decomposability checking. Then, a wire perturbation algorithm is presented to fix as many NCs in the layout as possible. The algorithm is based on iterative 1-D compaction and can easily be embedded into existing industrial compaction systems. The algorithm is then further applied to further reduce the number of stitches required for the decomposition process. Experimental results show that the proposed algorithm can significantly reduce the number of NCs by an average of 85% and reduce the number of stitches by an average of 39%, which may effectively increase the decomposition success rate for the next stage.
    其他題名: TCAD
    出版者: New York: IEEE
    出版日期: 2012-05
    出處: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2012-05, Vol.31 (5), p.703-716
    資源來源: IEEE Electronic Library (IEL)
    版權: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2012
    識別號: ISSN: 0278-0070
    識別號: EISSN: 1937-4151
    識別號: DOI: 10.1109/TCAD.2011.2179039
    識別號: CODEN: ITCSDI
    Appears in Collections:[Department of Optics and Photonics] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML14View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明