Implicit Connection Graph Maze Routing for Layout Migration
碩士 === 國立清華大學 === 資訊工程學系 === 103 === With advanced Very-Large-Scale Integration (VLSI) technology, migration method is more important in analog circuit or some special custom design. Sometimes two blocks in circuit will be migrated with different scale factor, and result in some connection between t...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/49609235325364201357 |
id |
ndltd-TW-103NTHU5392089 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NTHU53920892016-08-15T04:17:33Z http://ndltd.ncl.edu.tw/handle/49609235325364201357 Implicit Connection Graph Maze Routing for Layout Migration 為了製程遷徙的基於隱性連通圖的迷宮繞線 Lin, Ting Chun 林鼎鈞 碩士 國立清華大學 資訊工程學系 103 With advanced Very-Large-Scale Integration (VLSI) technology, migration method is more important in analog circuit or some special custom design. Sometimes two blocks in circuit will be migrated with different scale factor, and result in some connection between two blocks broken. To solve the problem described before, we propose a scanline base break point detection method that can construct the connection between polygons efficient. After compare the connection between non-sizing and sizing, we can obtain all break point what we need to route. To route the break point, an implicit connection graph base maze router is proposed, it can fully use the routing resource and get a small bend solution. As the result, our router use in layout migration method has a DRC clean solution in a real case. ii Mak, Wai Kei 麥偉基 2015 學位論文 ; thesis 28 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 資訊工程學系 === 103 === With advanced Very-Large-Scale Integration (VLSI) technology, migration method is
more important in analog circuit or some special custom design. Sometimes two blocks in
circuit will be migrated with different scale factor, and result in some connection between
two blocks broken. To solve the problem described before, we propose a scanline base
break point detection method that can construct the connection between polygons efficient.
After compare the connection between non-sizing and sizing, we can obtain all break point
what we need to route. To route the break point, an implicit connection graph base maze
router is proposed, it can fully use the routing resource and get a small bend solution. As
the result, our router use in layout migration method has a DRC clean solution in a real
case.
ii
|
author2 |
Mak, Wai Kei |
author_facet |
Mak, Wai Kei Lin, Ting Chun 林鼎鈞 |
author |
Lin, Ting Chun 林鼎鈞 |
spellingShingle |
Lin, Ting Chun 林鼎鈞 Implicit Connection Graph Maze Routing for Layout Migration |
author_sort |
Lin, Ting Chun |
title |
Implicit Connection Graph Maze Routing for Layout Migration |
title_short |
Implicit Connection Graph Maze Routing for Layout Migration |
title_full |
Implicit Connection Graph Maze Routing for Layout Migration |
title_fullStr |
Implicit Connection Graph Maze Routing for Layout Migration |
title_full_unstemmed |
Implicit Connection Graph Maze Routing for Layout Migration |
title_sort |
implicit connection graph maze routing for layout migration |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/49609235325364201357 |
work_keys_str_mv |
AT lintingchun implicitconnectiongraphmazeroutingforlayoutmigration AT líndǐngjūn implicitconnectiongraphmazeroutingforlayoutmigration AT lintingchun wèilezhìchéngqiānxǐdejīyúyǐnxìngliántōngtúdemígōngràoxiàn AT líndǐngjūn wèilezhìchéngqiānxǐdejīyúyǐnxìngliántōngtúdemígōngràoxiàn |
_version_ |
1718376229981126656 |