English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94201/94201 (100%)
造訪人次 : 81510127      線上人數 : 3151
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/103789


    題名: Native-conflict and stitch-aware wire perturbation for double patterning technology
    作者: 陳思妤;Fang, Shao-Yun;Chen, Szu-Yu;Chang, Yao-Wen
    貢獻者: 理學院光電科學與工程學系
    關鍵詞: 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
    日期: 2012-05-01
    上傳時間: 2026-04-23 11:37:37 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
    摘要: 摘要: 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
    顯示於類別:[光電科學與工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML14檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 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 ©   - 隱私權政策聲明