(3.236.214.19) 您好!臺灣時間:2021/05/09 21:47
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:林欣賢
研究生(外文):Hsin-Hsien Lin
論文名稱:基底接點與裝置的覆蓋範圍之閂鎖效應檢查演算法研究
論文名稱(外文):Latch-Up Check For well pickup/device coverage
指導教授:季凡峻
學位類別:碩士
校院名稱:明道大學
系所名稱:管理研究所
學門:商業及管理學門
學類:企業管理學類
論文種類:學術論文
論文出版年:2006
畢業學年度:95
語文別:中文
論文頁數:56
中文關鍵詞:閂鎖效應迪勞聶三角型
外文關鍵詞:latch-upDT
相關次數:
  • 被引用被引用:0
  • 點閱點閱:109
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
閂鎖效應(Latch-Up)是互補式金氧半導體積體電路在產品可靠度上可能發生的特有現象。它的發生會使電路元件進入一種低阻抗(low impedance)、高電流高能量的操作狀態,並進一步產生熱跳脫(Thermal runaway)的情形,致使積體電路產品燒燬(burned out)。
本研究主要是要在電路設計的部份,進行閂鎖效應檢查。預期在設計階段,使用建構DT(Delaunay Triangulation)的方式,就要透過程式的運算來避免閂鎖效應,減少積體電路損壞的機率。並且在實驗的過程中加入與先前類似研究不同的規則,以改善檢查的效率及方式。
本研究的最大貢獻在於能夠正確的檢查出閂鎖效應發生的裝置,並且提高檢查的效率及改善運算的效能。由於受限於設備的限制,本研究僅是演算法的探討,並未在實際的晶片上操作。
Latch up check, especially the pickup (or tie)/device coverage, has become an important check in most leading edge technology. The rule requires that all devices in a well should be covered by a pickup within a specified distance. It is used to check the electrical integrity of wells.
This paper is mainly a part designed on the chip design, carry on the effect inspection of latch-up. Expected to use and build the way to construct DT (Delaunay triangulation ) , will avoid the latch-up effect through the operation of the procedure soon during the course of designing, reduce the probability that the integrated chip is damaged . And accede to and study different rules similarly before in the course of experiment , by improving the efficiency and way checked.
The major contribution of this paper is to check latch-up correctly, and improve the efficiency checked and efficiency of improving operation. Because limited to the restriction of the equipment, this research is only a discussion which performs the algorithm, not the operation on the real chip.
誌謝 I
摘要 III
Abstract IV
目錄 V
圖目錄 VI
表目錄 VIII
第一章 前言 1
1.1 研究背景 1
1.2 研究動機 7
1.2.1 特殊考慮—閂鎖作用 8
1.2.2 特殊考慮一靜電放電(Electro-Static Discharge, ESD) 8
1.3 研究目的 11
第二章 文獻回顧 15
2.1 Latch-Up的相關研究探討 15
2.2 Latch-Up的影響 19
第三章 實驗設計 20
3.1 實驗設計 20
3.2 輸入資料說明 21
3.3 輸出報告 23
第四章 實驗結果與分析 24
4.1 井區的建構 24
4.2 DT的建構 26
4.3 刪去不必要的連線 30
4.4 計算路徑長度 31
4.5 合法及非法裝置的判定 38
4.6 新規則的加入 40
第五章 結論與建議 43
5.1 結論 43
5.2 建議 44
參考文獻 45
[1]R. Wilson, .Failures plague 130-nanometer IC processes,. EE Times, 2002, http://www.eetimes.com/news/semi/showArticle.jhtml?articleID=10805088
[2]S.-Y. Chiang, .”Foundry technology reliability,. Presentation Slides for Keynote Talk of IEEE IRPS”, p. 11.2003.
[3]E. T. Ogawa, J. W. McPherson, J. A. Rosal, K. J. Dickerson, T.-C. Chiu, L. Y. Tsung, M. K. Jain, T. D. Bonifield, J. C. Ondrusek, and W. R.McKee, .”Stress-induced voiding under vias connected to wide Cu metal leads”, in Proc. of IEEE IRPS, pp312-321, 2002.
[4]A. S. Oates, “Electromigration in stress-voided Al alloy conductors”, in Proc. of IEEE IRPS, pp. 297-303,1993,
[5]A. Loke and T. T. Wee, ”Introduction to on-chip copper/low-k interconnects & electromigration fundamentals”, Technical Seminar of IEEE Solid-State Circuits Society, p. 19, Sept. 2003.
[6]M.-D. Ker and C.-Y. Wu, “Modeling the positive-feedback regenerative process of CMOS latch-up by a positive transient pole method. I. theoretical derivation,” IEEE Trans. on ED, vol. 42, no. 6, pp. 1141-1148, June 1995.
[7]M.-D. Ker and C.-Y. Wu, ”Modeling the positive-feedback regenerative process of CMOS latch-up by a positive transient pole method. II. Quantitative evaluation,” IEEE Trans. on ED, vol. 42, no. 6, pp. 1149-1155, June 1995.
[8]S. Bargstadt-Franke, W. Stadler, K. Esmark, M. Streibl, K. Domanski, H. Gieser, H. Wolf, et. al., .Transient latch-up: experimental analysis and device simulation,. Microelectronics Reliability, vol. 45, no. 2, pp. 297-304, Feb. 2005.
[9]M.-D. Ker, H.-C. Jiang, J.-J. Peng, and T.-L. Shieh, “Automatic methodology for placing the guard rings into chip layout to prevent latch-up in CMOS IC’s,” in Proc. of IEEE ICECS, vol. 1, pp. 113-116,2001.
[10]GeomSizeInTub command in Diva 5.0 Reference Manual, Cadence Design Systems, Inc.
[11]Dijkstra algorithm, http://www.answers.com/topic/dijkstra-s-algorithm
[12]Joon Shik Lim, S.Sitharama Iyengar and Si-Qing Zheng, “Euclidean Shortest Path Problem with Rectilinear Obstacles” in Proc. 6th International Conference on VLSI Design, pp. 90 – 93, January 1993.
[13]J. Hershberger and S. Suri “Efficient Computation of Euclidean Shortest Paths in the Plane” in Proc. 34th Annual Symposium on Foundations of Computer Science, pp. 508 – 517, Nov. 1993.
[14]S. Kappor, S.N. Maheshwari and J.S.B.Mitchell “An efficient Algorithm for Euclidean Shortest Path Among Polygon Obstacles” in Proc. 4th ACM Symposium on Computational Geometry, pp. 172 – 182,1988.
[15]吳振君 施斌 祁長青,“任意多介質區域變尺寸有限元網格自動剖分"工程地質電腦應用,2002 年4 期 總28 期
[16]北京市勘察設計研究院- TIN & Voronoi & Delaunay URL:http://www.geoxd.com/graphic_idl_TIN.htm
[17]Zhe Feng and Yu Hu “An O(nlogn) Algorithm for Obstacle-Avoiding Routing Tree Construction in the λ-Geometry Plane” in ISPD’06, San Jose, CA, U.S.A, April 9–12, 2006.
[18]田麗鈞,輸入/輸出元件自動化佈局產生器設計,南台科技大學,碩士論文,2004年
[19]黃致遠,靜電放電保護電路設計遠閂鎖效應防制之研究,大葉大學,碩士論文,2002年
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔