簡易檢索 / 詳目顯示

研究生: 陳建璋
Chien-Chang Chen
論文名稱: 多重設計專案晶圓之佈局與切割
Multi-Project Wafer Floorplanning and Dicing
指導教授: 麥偉基
Wai-Kei Mak
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2005
畢業學年度: 93
語文別: 英文
論文頁數: 30
中文關鍵詞: 線性規劃積體電路模擬退火光罩共乘晶圓佈局
外文關鍵詞: linear program, VLSI, Simulated Annealing, Shuttle Mask, wafer, floorplan
相關次數: 點閱:1下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 隨著積體電路製程進步到深次微米的時代,光罩製作的成本可達到一、兩百萬美金之多。多重設計專案晶圓(MPW)可以將不同的設計放在同一組光罩裡,進而降低整體製造的成本。然而,因為晶片設計複雜度的不同,每個設計都有其所需要的製程(technology process),例如某一個設計需要一層複晶(poly)及四層的金屬層(metal layers),而某個較複雜的設計可能需要更多層的金屬層。而且,不同製程的設計無法從同一片晶圓(wafer)中切割生產出來,但是它們可以放在同一組光罩中來降低整體製造的成本。在本篇論文中,我們提出一個以線性規劃為基礎的(ILP-based)的佈局器(floorplanner)來解決光罩佈局(reticle floorplan)的問題。同時,我們也提出以模擬退火為基礎(SA-based)且能考量到圓形晶圓的晶圓切割法。由實驗的結果可觀察出我們的方法比之前所提出的佈局器平均而言能節省約28%的成本


    As the VLSI manufacturing technology advances into the deep sub-micron (DSM) era, the mask cost can reach one or two million dollars. Multiple project wafers (MPW) which puts different dies onto the same set of masks is a good cost-sharing approach. Every design needs to be produced by its desired technology process, such as 1 poly with 4 metal layers (1P4M), or 1 poly with 5 metal layers (1P5M). Dies with different desired manufacturing processes cannot be produced from the same wafer, but they can be put onto the same set of masks in order to reduce the total cost of used masks and wafers. In this thesis, we propose a novel integer linear programming (ILP)-based floorplanner for shuttle runs consisting of projects requiring different desired processes. A simulated annealing-based side-to-side wafer dicing planner which takes into account the circular shape of the wafer is also presented. This problem formulation was not considered and discussed before. Experimental results show that our approach achieves 28% wafer reduction on average compared to a previous simulated annealing-based reticle floorplanner.

    Chapter 1 Introduction.................................1 Chapter 2 Previous Work................................5 Chapter 3 Integer Linear Programming-based Floorplanner..10 Chapter 4 Simulated Annealing-based Wafer Dicing Planner.18 Chapter 5 Experimental Results.....22 Chapter 6 Conclusion......28 Reference.........29

    [1] W. Gorbman, R. Boone, C. Phibin, and B. Jarvis, “Reticle Enhancement Technology Trends: Resource and Manufacturability Implication for the Implementation of Physical Design” in Proc. of ACM/IEEE on ISPD, pp. 45-51, 2001

    [2] John, and B. Lin, “Mask Cost and Cycle Time Reduction” http://www.sematech.org/resources/litho/meetings/mask/20011001/E_TSMC.PDF

    [3] C. Yang, “Challenges of Mask Cost & Cycle Time” http://www.sematech.org/resources/litho/meetings/mask/20011001/K_Mask_cost_Intel.pdf

    [4] S. Chen and E. C. Lynn, “Efficient Placement of Chips on a Shuttle Mask”, in Proc. of SPIE, Vol. 5130, 2003, pp.681-688.

    [5] M. Andersson, C. Levcopoulos, and J. Gudmundsson, “Chips on Wafers” in Proc. Workshop on Algorithms and Data Structures, 2003.

    [6] G. Xu, R. Tian, D. F. Wang, and A. Reich “Shuttle Mask Floorplanning” in Proc. of SPIE, Vol. 5256, 2003, pp.185-194.

    [7] A. B. Kahng, I. Mandoiu, Q. Wang, X. Xu, and A. Zelikovsky, “Multi-Project Reticle Floorplanning and Wafer Dicing” in Proc. of ACM/IEEE on ISPD, 2004, pp. 70-77.

    [8] G. Xu, R. Tian, D. Z. Pan, and D. F. Wang “A Multiple-objective Floorplanner for Shuttle Mask Optimization” in Proc. of SPIE, Vol. 5567 , 2004, pp.185-144.

    [9] A. B. Kahng, and S. Reda, “Reticle Floorplanning With Guaranteed Yield for Multi-Project Wafers” in Proc. of ACM/IEEE on ICCD, 2004, pp. 106-110.

    [10] M. C. Wu and R. B. Lin, “ Reticle Floorplanning and Wafer Dicing for Multiple Project Wafers” in Proc. of ISQED, 2005.

    [11] M. C. Wu and R. B. Lin, “ Reticle Floorplanning of Flexible Chips for Multi-project Wafers” in Proc. of GLSVLSI, 2005.

    [12] M. Berkelaar, K. Eikland, P. Notebaert, lp_solve, available from http://groups.yahoo.com.tw/group/lp_solve.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE