• 沒有找到結果。

考量晶片封裝共同設計時的區域輸入輸出緩衝器線路重佈繞線實作

N/A
N/A
Protected

Academic year: 2021

Share "考量晶片封裝共同設計時的區域輸入輸出緩衝器線路重佈繞線實作"

Copied!
4
0
0

加載中.... (立即查看全文)

全文

(1)

國 立 交 通 大 學

電子工程學系 電子研究所 碩士班

考量晶片封裝共同設計時的區域輸入輸出緩衝器

線路重佈繞線實作

An Implementation of Area-I/O RDL Routing for

Chip-Package Codesign

研 究 生:林昆生(Kun-Sheng Lin)

指導教授: 陳宏明 教授(Prof. Hung-Ming Chen)

(2)

ii

考量晶片封裝共同設計時的區域輸入輸出緩衝器

線路重佈繞線實作

An Implementation of Area I/O RDL Routing for

Chip-Package Codesign

研 究 生:林昆生 Student:Kun-Sheng Lin

指導教授:陳宏明 教授 Advisor:Professor Hung-Ming Chen

國 立 交 通 大 學

電 子 工 程 學 系 電 子 研 究 所 碩 士 班

碩 士 論 文

A Thesis

Submitted to Department of Electrical Engineering & Institute of Electronics

College of Electrical Engineering and Computer Engineering

National Chiao Tung University

in Partial Fulfillment of the Requirements

for the Degree of

Master

in

Electronics Engineering

March 2010

Hsinchu, Taiwan, Republic of China

(3)

iii

考量晶片封裝共同設計時的區域輸入輸出緩衝器

線路重佈繞線實作

學生:林昆生 指導教授:陳宏明 教授

國立交通大學 電子工程學系 電子研究所碩士班

摘 要

覆晶封裝是由IBM在60年代所發展出來的,它提供一個高密

度的解決方法給需求更多輸出入緩衝器的超大積體電路設計。線路重

佈繞線問題是用來連接晶片以及封裝,這代表線路重佈繞線的結果將

會影響晶片效能以及封裝效能。因此,近幾年來晶片-封裝-基板共

同設計開始被提出並且逐漸受到重視。在這篇論文裡面我們提出一個

考慮晶片-封裝共同設計時的區域輸入輸出緩衝器線路重佈繞線演

算法。這個演算法包含晶片層級的分配以及線路重佈層級的繞線。我

們在各個層級時不僅僅考量繞線長度還同時考量信號分配的影響。實

驗數據顯示我們的方法可以在合理的接線長度內,大幅改善錫球分配

並且達到百分之百的線路重佈繞線能力。

(4)

iv

An Implementation of Area I/O RDL Routing for

Chip-Package Codesign

Student: Kun-Sheng Lin Advisor: Prof. Hung-Ming Chen

Department of Electronic Engineering Institute of Electronic

National Chiao Tung University

Abstract

The flip-chip package which was developed by IBM in the 60's provides a high chip-density solution to the demand of more I/O buffers in VLSI designs. The RDL routing problem is connected between chip domain and package domain, which means that the result of the RDL routing problem has strong influences on the chip performance and the package performance. Therefore, the concept of chip-package-board codesign is proposed and it is become more popular in recent years. In this thesis, we propose a routing algorithm for area-I/O RDL routing problem. Our algorithm contains chip-level assignment and RDL-level routing. In both chip-level assignment and RDL-level routing, we take not only wirelength but also signal influence into account. Experimental results have shown that our algorithm can improve bump assignment significantly with reasonable extra wirelength and it can achieve 100\% RDL routability.

參考文獻

相關文件

Given a graph and a set of p sources, the problem of finding the minimum routing cost spanning tree (MRCT) is NP-hard for any constant p > 1 [9].. When p = 1, i.e., there is only

• Any node that does not have a local replica of the object periodically creates a QoS-advert message contains (a) its δ i deadline value and (b) depending-on , the ID of the node

Therefore, the purpose of this study is to propose a model, named as the Interhub Heterogeneous Fleet Routing Problem (IHFRP), to deal with the route design

此外,由文獻回顧(詳第二章)可知,實務的車輛配送路線排程可藉由車 輛路線問題(Vehicle Routing

This paper formulates the above situation to the Multi-temperature Refrigerated Container Vehicle Routing Problem (MRCVRP), and proposes a two-stage heuristic which consists of

Abstract: This paper presents a meta-heuristic, which is based on the Threshold Accepting combined with modified Nearest Neighbor and Exchange procedures, to solve the Vehicle

針對上述問題及根據其他接駁配送方式,本研究提出「多重補貨點接駁車 輛路線問題 (Multi-Point Feeder Vehicle Routing Problem, MFVRP)」

Compared with the combination of our IO assignment, the single-layer BGA global router[1] and our detailed routing phase, our RDL router reduces the global wirelength by 15.9%