{"updated":"2025-01-22T18:23:29.258320+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00027749","sets":["1164:2036:2094:2096"]},"path":["2096"],"owner":"1","recid":"27749","title":["変数の重なりのない単純な関数分解を用いた組合せ回路の改善方法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-09-21"},"_buckets":{"deposit":"279dc66b-deec-4c07-96f2-51c742fe6afd"},"_deposit":{"id":"27749","pid":{"type":"depid","value":"27749","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"変数の重なりのない単純な関数分解を用いた組合せ回路の改善方法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"変数の重なりのない単純な関数分解を用いた組合せ回路の改善方法"},{"subitem_title":"A Method for Improving Combinational Circuits using Simple Disjunctive Decompositions","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1998-09-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTコミュニケーション科学研究所"},{"subitem_text_value":"NTTコミュニケーション科学研究所"},{"subitem_text_value":"NTTコミュニケーション科学研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories","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/27749/files/IPSJ-SLDM98089015.pdf"},"date":[{"dateType":"Available","dateValue":"2000-09-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM98089015.pdf","filesize":[{"value":"517.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":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ea16beea-afb3-4c67-a179-83df180763ec","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"澤田, 宏"},{"creatorName":"山下, 茂"},{"creatorName":"名古屋, 彰"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroshi, Sawada","creatorNameLang":"en"},{"creatorName":"Shigeru, Yamashita","creatorNameLang":"en"},{"creatorName":"Akira, Nagoya","creatorNameLang":"en"}],"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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"変数の重なりのない単純な関数分解f(X Y)=h(g(X) Y)は，関数分解の特別な形であり，1出力関数に対する最適な組合せ回路の形を提供する．本稿では，多入力1出力の組合せ回路Fにおいて，回路F全体の論理関数fが上記の分解を持つ場合に，この分解を適用することで回路を改善する手法を提案する．分解後の関数gとhを実現する新たな組合せ回路GとHは，元の回路Fのいくつかの入力に，ある定数値を代入することで求めることができる．実験結果より，組合せ回路最適化プログラムの前処理として，本手法が特に有効であることがわかった．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Simple disjunctive decomposition f(X,Y)=h(g(X),Y) is a special case of a functional decomposition, which offers an optimum circuits structure for a single-output logic function. This paper presents a method for improving combinational circuits by applying the above decomposition when exists in a function f represented by a given multi-input single-output circuit F. We can easily construct new circuits G and H that represent the new functions g and h, respectively, by assigning constant values to some inputs in the original circuit F. Experimental results show that the proposed method is very effective as a preprocessor for a combinational circuit optimization program.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"112","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"107","bibliographicIssueDates":{"bibliographicIssueDate":"1998-09-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"87(1998-SLDM-089)","bibliographicVolumeNumber":"1998"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:58:01.888526+00:00","id":27749,"links":{}}