{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240472","sets":["1164:2036:11466:11784"]},"path":["11784"],"owner":"44499","recid":"240472","title":["トップダウンZDD構築法を用いた多端子ナンバーリンク問題の全解探索アルゴリズムの改良"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-10-31"},"_buckets":{"deposit":"475fa8f1-a214-4abf-8b4b-e756f2fc6cb9"},"_deposit":{"id":"240472","pid":{"type":"depid","value":"240472","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"トップダウンZDD構築法を用いた多端子ナンバーリンク問題の全解探索アルゴリズムの改良","author_link":["659732","659730","659731"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"トップダウンZDD構築法を用いた多端子ナンバーリンク問題の全解探索アルゴリズムの改良"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ポスター","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-10-31","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"立命館大学大学院情報理工学研究科"},{"subitem_text_value":"明治大学理工学部"},{"subitem_text_value":"立命館大学大学院情報理工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Engineering, Ritsumeikan University","subitem_text_language":"en"},{"subitem_text_value":"School of Science and Technology, Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Engineering, Ritsumeikan University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/240472/files/IPSJ-SLDM24206005.pdf","label":"IPSJ-SLDM24206005.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-31"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM24206005.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"392583cc-8b9c-4b69-ab4a-050b943bf5fb","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"李, 宣岐"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"今川, 隆司"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"越智, 裕之"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8639","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では，従来の 2 端子のナンバーリンクの拡張問題である多端子ナンバーリンクを対象とし，その全ての解を列挙するアルゴリズムを改良する．ナンバーリンクは理論的には NP 完全問題であり，実際には VLSI および PCB の平面配線を模倣しているため，これを解くための様々なアルゴリズムが開発されている．トップダウン ZDD 構築法を用いた既存手法により，ナンバーリンクの全ての解を効率的に列挙でき，これによって得られるナンバーリンクの解の個数は配線の代替経路の多さを表していると考えられ，FPGA 等の配線アーキテクチャの配線自由度などの評価指標としての利用が期待される．しかしこの ZDD ベースのアルゴリズムは，各ネットがちょうど 2 つの端子を持つというナンバーリンクの前提に特化されており，実際の配線対象となる回路とは乖離している．我々はマルチファンアウトのネットを配線できる，多端子ナンバーリンク用に拡張した ZDD ベースのアルゴリズムを提案したが，これを 2 端子のナンバーリンクに適用した時のオーバヘッドが大きいことが課題であった．本稿はこれを改善するため，総分岐数超過の検出を導入する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-31","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2024-SLDM-206"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":240472,"updated":"2025-01-19T07:58:09.163015+00:00","links":{},"created":"2025-01-19T01:44:40.867552+00:00"}