ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "bc05c935-4e5e-42e7-87a3-6db06f4cf0b7"}, "_deposit": {"id": "1713", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "1713"}, "status": "published"}, "_oai": {"id": "oai:niigata-u.repo.nii.ac.jp:00001713", "sets": ["454", "470"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2001-02", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "2", "bibliographicPageEnd": "289", "bibliographicPageStart": "281", "bibliographicVolumeNumber": "20", "bibliographic_titles": [{"bibliographic_title": "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"}, {"bibliographic_title": "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems", "bibliographic_titleLang": "en"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We present an ordered tree (O tree) structure to represent nonslicing floorplans. The O tree uses only n(2+[lg n]) bits for a floorplan of n rectangular blocks. We define an admissible placement as a compacted placement in both x and y directions. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree combinations is O(n!22n-2/nl.5). This is very concise compared to a sequence pair representation that has O((n!)2) combinations. The approximate ratio of sequence pair and O-tree combinations is O(n2(n/4e)n). The complexity of O tree is even smaller than a binary tree structure for slicing floorplan that has O(n!25n-3/n1.5) combinations. Given an O tree, it takes only linear time to construct the placement and its constraint graph. We have developed a deterministic floorplanning algorithm utilizing the structure of O tree. Empirical results on MCNC (www.mcnc.org) benchmarks show promising performance with average 16% improvement in wire length and 1% less dead space over previous central processing unit (CPU) intensive cluster refinement method", "subitem_description_type": "Abstract"}]}, "item_5_full_name_3": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "5166", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "Takahashi, Toshihiko"}]}, {"nameIdentifiers": [{"nameIdentifier": "5167", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "高橋, 俊彦"}]}]}, "item_5_publisher_7": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEEE"}]}, "item_5_relation_14": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "info:doi/10.1109/43.908471", "subitem_relation_type_select": "DOI"}}]}, "item_5_rights_15": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "©(2001) IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained the IEEE."}]}, "item_5_select_19": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_5_source_id_11": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA10629136", "subitem_source_identifier_type": "NCID"}]}, "item_5_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "02780070", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Guo, P. N."}], "nameIdentifiers": [{"nameIdentifier": "5162", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Takahashi, T."}], "nameIdentifiers": [{"nameIdentifier": "5163", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Cheng, C. K."}], "nameIdentifiers": [{"nameIdentifier": "5164", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yoshimura, T."}], "nameIdentifiers": [{"nameIdentifier": "5165", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-07-29"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "TCAD_20.pdf", "filesize": [{"value": "3.7 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 3700000.0, "url": {"label": "TCAD_20.pdf", "url": "https://niigata-u.repo.nii.ac.jp/record/1713/files/TCAD_20.pdf"}, "version_id": "84de1ec4-d4b2-41f7-915a-4fddcf5d1e96"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Building block placement", "subitem_subject_scheme": "Other"}, {"subitem_subject": "floorplan", "subitem_subject_scheme": "Other"}, {"subitem_subject": "rooted ordered tree", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Floorplanning using a tree representation", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Floorplanning using a tree representation"}, {"subitem_title": "Floorplanning using a tree representation", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "1", "path": ["454", "470"], "permalink_uri": "http://hdl.handle.net/10191/4979", "pubdate": {"attribute_name": "公開日", "attribute_value": "2007-09-07"}, "publish_date": "2007-09-07", "publish_status": "0", "recid": "1713", "relation": {}, "relation_version_is_last": true, "title": ["Floorplanning using a tree representation"], "weko_shared_id": null}
  1. 0 資料タイプ別
  2. 01 学術雑誌論文
  1. 230 大学院自然科学研究科
  2. 10 学術雑誌論文
  3. 10 査読済論文

Floorplanning using a tree representation

http://hdl.handle.net/10191/4979
http://hdl.handle.net/10191/4979
aac47068-4c76-4caf-ab70-ba7a89a9e130
名前 / ファイル ライセンス アクション
TCAD_20.pdf TCAD_20.pdf (3.7 MB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2007-09-07
タイトル
タイトル Floorplanning using a tree representation
タイトル
言語 en
タイトル Floorplanning using a tree representation
言語
言語 eng
キーワード
主題Scheme Other
主題 Building block placement
キーワード
主題Scheme Other
主題 floorplan
キーワード
主題Scheme Other
主題 rooted ordered tree
資源タイプ
資源 http://purl.org/coar/resource_type/c_6501
タイプ journal article
著者 Guo, P. N.

× Guo, P. N.

WEKO 5162

Guo, P. N.

Search repository
Takahashi, T.

× Takahashi, T.

WEKO 5163

Takahashi, T.

Search repository
Cheng, C. K.

× Cheng, C. K.

WEKO 5164

Cheng, C. K.

Search repository
Yoshimura, T.

× Yoshimura, T.

WEKO 5165

Yoshimura, T.

Search repository
著者別名
識別子 5166
識別子Scheme WEKO
姓名 Takahashi, Toshihiko
著者別名
識別子 5167
識別子Scheme WEKO
姓名 高橋, 俊彦
抄録
内容記述タイプ Abstract
内容記述 We present an ordered tree (O tree) structure to represent nonslicing floorplans. The O tree uses only n(2+[lg n]) bits for a floorplan of n rectangular blocks. We define an admissible placement as a compacted placement in both x and y directions. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree combinations is O(n!22n-2/nl.5). This is very concise compared to a sequence pair representation that has O((n!)2) combinations. The approximate ratio of sequence pair and O-tree combinations is O(n2(n/4e)n). The complexity of O tree is even smaller than a binary tree structure for slicing floorplan that has O(n!25n-3/n1.5) combinations. Given an O tree, it takes only linear time to construct the placement and its constraint graph. We have developed a deterministic floorplanning algorithm utilizing the structure of O tree. Empirical results on MCNC (www.mcnc.org) benchmarks show promising performance with average 16% improvement in wire length and 1% less dead space over previous central processing unit (CPU) intensive cluster refinement method
書誌情報 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
en : IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

巻 20, 号 2, p. 281-289, 発行日 2001-02
出版者
出版者 IEEE
ISSN
収録物識別子タイプ ISSN
収録物識別子 02780070
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA10629136
DOI
識別子タイプ DOI
関連識別子 info:doi/10.1109/43.908471
権利
権利情報 ©(2001) IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained the IEEE.
著者版フラグ
値 publisher
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 20:54:15.369147
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3