{"updated":"2025-01-22T18:34:14.471254+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00027389","sets":["1164:2036:2067:2068"]},"path":["2068"],"owner":"1","recid":"27389","title":["順序回路方式LUTカスケードにおけるメモリパッキングについて"],"pubdate":{"attribute_name":"公開日","attribute_value":"2003-11-27"},"_buckets":{"deposit":"7a5308e0-ca9a-4432-9a98-2122fc20629e"},"_deposit":{"id":"27389","pid":{"type":"depid","value":"27389","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"順序回路方式LUTカスケードにおけるメモリパッキングについて","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"順序回路方式LUTカスケードにおけるメモリパッキングについて"},{"subitem_title":"Memory Packing Method in Sequential Look - Up Table Cascades","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2003-11-27","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 and Electronics, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Electronics, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science and Electronics, Kyushu Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Meiji 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/27389/files/IPSJ-SLDM03112043.pdf"},"date":[{"dateType":"Available","dateValue":"2005-11-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM03112043.pdf","filesize":[{"value":"507.6 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":"b72a78c1-07b2-4dc6-96bc-4f342d1c7ed5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2003 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":"Masaki, Kusano","creatorNameLang":"en"},{"creatorName":"Tsutomu, Sasao","creatorNameLang":"en"},{"creatorName":"Munehiro, Matsuura","creatorNameLang":"en"},{"creatorName":"Yukihiro, Iguchi","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":"順序回路方式LUTカスケードで，各セルの入力数を可変にした場合，各セルのデータを最小のメモリに格納する問題は，ビンパッキング問題と類似の問題となる．本稿では，この問題をダイナミック・プログラミングを用いて解く．本手法を用いて，LUTカスケードの段数を増加させることなく，メモリ量を元の大きさの40%まで削減できた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A sequential look-up table (LUT) cascade consists of memory and a control circuit, and simulates a combinational LUT cascade. In a sequential cascade, we assume that the number of inputs of each cell can be different. In this case, we can minimize the number of levels and total amount of memory for cascade by using dynamic programming. By using this technique, we could reduce the amount of memory into 40% of original size.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"270","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"265","bibliographicIssueDates":{"bibliographicIssueDate":"2003-11-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"120(2003-SLDM-112)","bibliographicVolumeNumber":"2003"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:57:45.702992+00:00","id":27389,"links":{}}