請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/77914
標題: | 整合扇出型晶圓級封裝堆疊設計之繞線系統 A Redistribution Layer Routing System for Wafer-Level Integrated Fan-Out Package-on-Packages |
作者: | Ting-Chou Lin 林庭州 |
指導教授: | 張耀文 |
關鍵字: | 實體設計,整合扇出型晶圓級封裝堆疊,重分佈層,重分佈層繞線, Physical Design,Wafer-Level Integrated Fan-Out Package-on-Package,Redistribution Layer,RDL Routing, |
出版年 : | 2017 |
學位: | 碩士 |
摘要: | 整合扇出型晶圓級封裝堆疊 (wafer-level integrated fan-out package-on-package) 是一個大有可為的立體封裝技術,此封裝技術通常會包含一個下層封裝採用整合扇出型晶圓級封裝技術和一個上層封裝堆疊在下層封裝上。與傳統的封裝堆疊不同之處在於,整合扇出型晶圓級封裝有正面和背面兩個多層重分佈層 (redistribution layer) 來進行訊號傳輸。據我們所知,目前尚未有發表的論文是針對處裡整合扇出型晶圓級封裝堆疊中的重分佈層繞線問題。大部分相關的發表論文著重於三種類型的重分佈層繞線問題,分別是自由配對繞線問題、非自由配對繞線問題與混合型配對繞線問題,並且考慮單一或是多個晶片。在此篇論文當中,我們提出了一個新的整合扇出型晶圓級封裝堆疊中的重分佈層繞線問題。為了彌補相關論文缺乏對於正面及背面兩個多層重分佈層的考慮,我們提出了第一個演算法來針對處理整合扇出型晶圓級封裝堆疊中的重分佈層繞線問題,此問題考慮到了訊號線的分層、重分佈層數量的最小化與總線長的最小化。我們提出了一個抽取多個遞增子序列 (increasing subsequence) 的演算法,這個演算法會轉換一個繞線順序成為兩個有向非循環圖 (directed acyclic graph) ,分別是遞增子序列有向非循環圖和限制有向非循環圖。藉由最小化在限制有向非循環圖上的最長路徑當中的節點數量,我們可以適當的減少重分佈層的數量。除此之外,我們會在遞增子序列有向非循環圖使用回朔法來將連線分配到適當的重分佈層來避免訊號線過長。實驗結果顯示我們的繞線器可以達到百分之百的繞線率,相較之下,相關發表論文所延伸的演算法無法達到百分之百的繞線率,並且會使用更多的正面多層重分佈層。 The wafer-level integrated fan-out (InFO) package-on-package (PoP) is a promising 3D packaging technology, which usually consists of a bottom package with the InFO technique, and a top package stacked on the bottom package.Different from the traditional PoPs, there are frontside and backside redistribution layers (RDLs) in the InFO PoP for signal redistributions.To the best of our knowledge, there is still no previous work specifically tackling the RDL routing for the InFO PoP.Previous works on RDL routing mainly deal with the following three types of routing: the free-assignment, pre-assignment, and unified-assignment routing for single or multiple chips.In this thesis, a new RDL routing problem for the InFO PoP is formulated. To remedy the deficiencies of lacking the interactions between frontside and backside RDLs, we present the first work in the literature to handle the unified-assignment multi-layer multi-package RDL routing problem (without RDL vias), considering layer assignment, layer number minimization, and total wirelength minimization. We propose an algorithm based on extracting increasing subsequences (IS), which transforms a routing sequence into two directed acyclic graphs (DAGs), namely, IS-DAG and Constraint-DAG.By minimizing the number of vertices on the longest path on the Constraint-DAG, we implicitly minimize the layer number.Furthermore, we perform backtracking on the IS-DAG to efficiently assign the connections to appropriate layers to avoid long detours.Experimental results show that our router can achieve 100% routablility for all given test cases, while the previous works with extensions fail all test cases even with more frontside RDLs. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/77914 |
DOI: | 10.6342/NTU201702852 |
全文授權: | 有償授權 |
顯示於系所單位: | 電子工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-106-R04943101-1.pdf 目前未授權公開取用 | 2.93 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。