RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing
碩士 === 國立交通大學 === 資訊科學系所 === 94 === RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing:the problem to find a flow which there is a minimal area SINO solution that is free of capacitive noise and is under the given inductive noise bound .We plan to construct flow which take performance a...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/93463312821043266045 |
id |
ndltd-TW-094NCTU5394010 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094NCTU53940102016-06-03T04:14:19Z http://ndltd.ncl.edu.tw/handle/93463312821043266045 RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing 細部繞線之前的一個電阻電感電容串擾界限設計流程 Peng-Yang Hung 洪鵬洋 碩士 國立交通大學 資訊科學系所 94 RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing:the problem to find a flow which there is a minimal area SINO solution that is free of capacitive noise and is under the given inductive noise bound .We plan to construct flow which take performance and RLC crosstalk bound into account. 1. An uniform distribution result of global route . 2. RLC-Bounded Track Assignment algorithm can make a result with capacitive noise free and minimal LSK value. 3. Tabular Shield Insertion algorithm can insert as few shields as possible .We hope to design a flow and algorithm for general case. Yih-Lang Li 李毅郎 2005 學位論文 ; thesis 34 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 資訊科學系所 === 94 === RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing:the problem to find a flow which there is a minimal area SINO solution that is free of capacitive noise and is under the given inductive noise bound .We plan to construct flow which take performance and RLC crosstalk bound into account. 1. An uniform distribution result of global route . 2. RLC-Bounded Track Assignment algorithm can make a result with capacitive noise free and minimal LSK value. 3. Tabular Shield Insertion algorithm can insert as few shields as possible .We hope to design a flow and algorithm for general case.
|
author2 |
Yih-Lang Li |
author_facet |
Yih-Lang Li Peng-Yang Hung 洪鵬洋 |
author |
Peng-Yang Hung 洪鵬洋 |
spellingShingle |
Peng-Yang Hung 洪鵬洋 RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing |
author_sort |
Peng-Yang Hung |
title |
RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing |
title_short |
RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing |
title_full |
RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing |
title_fullStr |
RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing |
title_full_unstemmed |
RLC Noise-Bounded Routing Design Flow Prior to Detailed Routing |
title_sort |
rlc noise-bounded routing design flow prior to detailed routing |
publishDate |
2005 |
url |
http://ndltd.ncl.edu.tw/handle/93463312821043266045 |
work_keys_str_mv |
AT pengyanghung rlcnoiseboundedroutingdesignflowpriortodetailedrouting AT hóngpéngyáng rlcnoiseboundedroutingdesignflowpriortodetailedrouting AT pengyanghung xìbùràoxiànzhīqiándeyīgèdiànzǔdiàngǎndiànróngchuànrǎojièxiànshèjìliúchéng AT hóngpéngyáng xìbùràoxiànzhīqiándeyīgèdiànzǔdiàngǎndiànróngchuànrǎojièxiànshèjìliúchéng |
_version_ |
1718293880074403840 |