On Hierarchical Submodule Extraction for Transistor Netlists
碩士 === 國立交通大學 === 電子工程系 === 91 === The growing of modern IC design complexity leads the consistency check and design verification during every level in design flow to be an important and challenged issue. In this thesis, we propose an efficient approach to rebuild the hierarchical level f...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/65596796604708642129 |
id |
ndltd-TW-091NCTU0428120 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091NCTU04281202016-06-22T04:14:26Z http://ndltd.ncl.edu.tw/handle/65596796604708642129 On Hierarchical Submodule Extraction for Transistor Netlists 針對電晶體電路之階層模組粹取 Yi-Wei Lin 林詣偉 碩士 國立交通大學 電子工程系 91 The growing of modern IC design complexity leads the consistency check and design verification during every level in design flow to be an important and challenged issue. In this thesis, we propose an efficient approach to rebuild the hierarchical level from low level circuits. Our approach is based on the structure equivalent expansion algorithm to find repeated submodules in every circuit level to reconstruct circuit hierarchy. Without any addition library information, our approach is quite efficient in both time and space complexities by using only flatten netlists. The experiments on many real circuits containing combinational, sequential, and memory circuits show that our approach can rebuild most circuit hierarchical levels and also reduce the verification effort of the circuits. Jing-Yang Jou 周景揚 2003 學位論文 ; thesis 39 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 電子工程系 === 91 === The growing of modern IC design complexity leads the consistency check and design verification during every level in design flow to be an important and challenged issue. In this thesis, we propose an efficient approach to rebuild the hierarchical level from low level circuits. Our approach is based on the structure equivalent expansion algorithm to find repeated submodules in every circuit level to reconstruct circuit hierarchy. Without any addition library information, our approach is quite efficient in both time and space complexities by using only flatten netlists. The experiments on many real circuits containing combinational, sequential, and memory circuits show that our approach can rebuild most circuit hierarchical levels and also reduce the verification effort of the circuits.
|
author2 |
Jing-Yang Jou |
author_facet |
Jing-Yang Jou Yi-Wei Lin 林詣偉 |
author |
Yi-Wei Lin 林詣偉 |
spellingShingle |
Yi-Wei Lin 林詣偉 On Hierarchical Submodule Extraction for Transistor Netlists |
author_sort |
Yi-Wei Lin |
title |
On Hierarchical Submodule Extraction for Transistor Netlists |
title_short |
On Hierarchical Submodule Extraction for Transistor Netlists |
title_full |
On Hierarchical Submodule Extraction for Transistor Netlists |
title_fullStr |
On Hierarchical Submodule Extraction for Transistor Netlists |
title_full_unstemmed |
On Hierarchical Submodule Extraction for Transistor Netlists |
title_sort |
on hierarchical submodule extraction for transistor netlists |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/65596796604708642129 |
work_keys_str_mv |
AT yiweilin onhierarchicalsubmoduleextractionfortransistornetlists AT línyìwěi onhierarchicalsubmoduleextractionfortransistornetlists AT yiweilin zhēnduìdiànjīngtǐdiànlùzhījiēcéngmózǔcuìqǔ AT línyìwěi zhēnduìdiànjīngtǐdiànlùzhījiēcéngmózǔcuìqǔ |
_version_ |
1718315162304249856 |