Layout Generator for Symmetric Analog Circuits
碩士 === 國立成功大學 === 電機工程學系碩博士班 === 101 === In past few years, analog design automation has attracted more attention, and many researches have been published. Most of them focus on placement of analog blocks without considering routing issues. Recently, some papers start to consider routability-driven...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/92033662672784934209 |
id |
ndltd-TW-101NCKU5442099 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101NCKU54420992016-03-18T04:42:18Z http://ndltd.ncl.edu.tw/handle/92033662672784934209 Layout Generator for Symmetric Analog Circuits 對稱型類比電路佈局圖產生器 Chung-LinLee 李宗霖 碩士 國立成功大學 電機工程學系碩博士班 101 In past few years, analog design automation has attracted more attention, and many researches have been published. Most of them focus on placement of analog blocks without considering routing issues. Recently, some papers start to consider routability-driven placement in analog circuits. However, their models used to estimate routing congestion are based on approaches for digital circuits, which make routing paths estimated by their models not match to real routing paths. Hence, this thesis proposes a shortest path estimation model to predict routing channels between any two modules during placement stage. Moreover, DRC rules are considered in placement methodology in order to obtain legal layouts. In addition to placement, a routing methodology used to route nets, which include signal nets and power nets, is proposed. We actually implement the design flow as a tool. The experimental results show our tool can generate layouts efficiently. More importantly, our tool gets better results in term of area and wirelength in all test cases comparing to the method which uses the bounding box estimation method. Jai-Ming Lin 林家民 2013 學位論文 ; thesis 53 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 電機工程學系碩博士班 === 101 === In past few years, analog design automation has attracted more attention, and many researches have been published. Most of them focus on placement of analog blocks without considering routing issues. Recently, some papers start to consider routability-driven placement in analog circuits. However, their models used to estimate routing congestion are based on approaches for digital circuits, which make routing paths estimated by their models not match to real routing paths. Hence, this thesis proposes a shortest path estimation model to predict routing channels between any two modules during placement stage. Moreover, DRC rules are considered in placement methodology in order to obtain legal layouts. In addition to placement, a routing methodology used to route nets, which include signal nets and power nets, is proposed. We actually implement the design flow as a tool. The experimental results show our tool can generate layouts efficiently. More importantly, our tool gets better results in term of area and wirelength in all test cases comparing to the method which uses the bounding box estimation method.
|
author2 |
Jai-Ming Lin |
author_facet |
Jai-Ming Lin Chung-LinLee 李宗霖 |
author |
Chung-LinLee 李宗霖 |
spellingShingle |
Chung-LinLee 李宗霖 Layout Generator for Symmetric Analog Circuits |
author_sort |
Chung-LinLee |
title |
Layout Generator for Symmetric Analog Circuits |
title_short |
Layout Generator for Symmetric Analog Circuits |
title_full |
Layout Generator for Symmetric Analog Circuits |
title_fullStr |
Layout Generator for Symmetric Analog Circuits |
title_full_unstemmed |
Layout Generator for Symmetric Analog Circuits |
title_sort |
layout generator for symmetric analog circuits |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/92033662672784934209 |
work_keys_str_mv |
AT chunglinlee layoutgeneratorforsymmetricanalogcircuits AT lǐzōnglín layoutgeneratorforsymmetricanalogcircuits AT chunglinlee duìchēngxínglèibǐdiànlùbùjútúchǎnshēngqì AT lǐzōnglín duìchēngxínglèibǐdiànlùbùjútúchǎnshēngqì |
_version_ |
1718208516161798144 |