{"created":"2025-01-18T22:57:52.325358+00:00","updated":"2025-01-22T18:29:36.323405+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00027539","sets":["1164:2036:2073:2077"]},"path":["2077"],"owner":"1","recid":"27539","title":["QRMDDを用いた論理関数の表現法について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-01-23"},"_buckets":{"deposit":"f8314c3b-39df-4059-bdbf-9fe240fc7834"},"_deposit":{"id":"27539","pid":{"type":"depid","value":"27539","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"QRMDDを用いた論理関数の表現法について","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"QRMDDを用いた論理関数の表現法について"},{"subitem_title":"Representations of Logic Functions using QRMDDs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2002-01-23","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"明治大学　理工学部"},{"subitem_text_value":"九州工業大学　情報工学部／九州工業大学　マイクロ化総合技術センタ"},{"subitem_text_value":"明治大学　理工学部"},{"subitem_text_value":"九州工業大学　情報工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Electronics, Kyushu Institute of Technology/Center of Microelectronic Systems, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Meiji University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Electronics, Kyushu Institute of Technology","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/27539/files/IPSJ-SLDM01104021.pdf"},"date":[{"dateType":"Available","dateValue":"2004-01-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM01104021.pdf","filesize":[{"value":"1.1 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":"759239b4-320c-4a45-9051-3b14ddd8dc38","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"永山, 忍"},{"creatorName":"笹尾, 勤"},{"creatorName":"井口, 幸洋"},{"creatorName":"松浦, 宗寛"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shinobu, Nagayama","creatorNameLang":"en"},{"creatorName":"Tsutomu, Sasao","creatorNameLang":"en"},{"creatorName":"Yukihiro, Iguchi","creatorNameLang":"en"},{"creatorName":"Munehiro, Matsuura","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":"本論文では、QRMDD(k)(Quasi-Reduced Multi-valued Decision Diagram with k bits) を用いた論理関数の表現に関して、以下のことを示す。ベンチマーク関数における、QRMDD(k) の節点数と k の値の関係、また QRMDD(k) の節点数の上界および、その上界と乱数関数を QRMDD(k) で表現したときの節点数の差、QRMDD(k) の総メモリ量、評価時間、および面積時間複雑度、k=3?6の時間、面積時間複雑度が最小となること。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we consider quasi-reduced multi-valued decision diagrams with k bits (QRMDD(k)s) to represent logic functions. We will show relations between the number of nodes in QRMDD(k)s and values of k for benchmark functions; an upper bound on the number of nodes in the QRMDD(k), difference between the upper bound and the number of nodes in the QRMDD(k)s for random functions; and the amount of total memory, evaluation time, and area-time complexity for QRMDD(k)s. Experimental results using standard benchmark functions show that the area-time complexity takes its minimum when k is between 3 and 6.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"160","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"153","bibliographicIssueDates":{"bibliographicIssueDate":"2002-01-23","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5(2001-SLDM-104)","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":27539,"links":{}}