{"id":23972,"created":"2025-01-18T22:55:13.939316+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00023972","sets":["1164:1579:1651:1652"]},"path":["1652"],"owner":"1","recid":"23972","title":["論理関数のXOR分解アルゴリズムについて"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-12-12"},"_buckets":{"deposit":"33a21371-7568-482e-a2ad-cac2ad4396fd"},"_deposit":{"id":"23972","pid":{"type":"depid","value":"23972","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"論理関数のXOR分解アルゴリズムについて","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"論理関数のXOR分解アルゴリズムについて"},{"subitem_title":"On Exclusive - Or Decomposition Algorithms of Logic Functions","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1996-12-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"（株）富士通研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Fujitsu Laboratories LTD.","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/23972/files/IPSJ-ARC96121001.pdf"},"date":[{"dateType":"Available","dateValue":"1998-12-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC96121001.pdf","filesize":[{"value":"532.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"57945544-9e6c-4a9d-b973-5c3b9c144b51","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松永, 裕介"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yusuke, Matsunaga","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ファクタードフォームはテクノロジ独立なレベルでの回路構造，および回路面積の見積りやテクノロジマッピングの初期解に適した論理関数表現であるが，AND/OR演算子のみを用いているのでXORを含んだ回路に対しては適切な論理式表現とならない．本稿では，XOR演算子を含んだファクタードフォームを生成するための一手法として，関数のXOR分解について取り上げ，2種類のアルゴリズムを提案する．一つは互いに素なサポートを持つ関数への分解を行なうアルゴリズムであり，もう一つはただ一つの変数を共通のサポートとして持つ関数への分解を行なうアルゴリズムである．どちらも二分決定グラフを用いて効率良く実行することができるので，従来のファクタリングアルゴリズムと組み合わせることで，より簡潔な論理式表現を得ることができる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Factored form is a natural way to express a logic function with keeping multi-level logic circuit's structure. Thus, its literal count is generally used for evaluating circuit area in technology independent level. And factored form is also a good start point to technology mapping. However, in the case of technology mapping including XOR cells, factored form is not a good measure nor a good start point, because it consists of only AND/OR terms. So, effective algorithms to find a good logic expression including XOR terms are required. This paper describes novel XOR factoring algorithms that find a disjoint support decomposition or a single overlapping support decomposition. Implemented with Binary Decision Diagrams, these algorithms are very efficient. Combining these XOR factoring algorithms with the conventional AND/OR factoring algorithms, simpler logic expressions are expected to be derived.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告計算機アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1996-12-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"121(1996-ARC-121)","bibliographicVolumeNumber":"1996"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T20:07:09.710187+00:00","links":{}}