{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216079","sets":["1164:2036:10820:10821"]},"path":["10821"],"owner":"44499","recid":"216079","title":["CNNの組み合わせ回路実装に向けた重み調整によるLUT数削減手法の検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-01-17"},"_buckets":{"deposit":"63cf4d1d-90d2-46b1-82fb-1381f8a64ad4"},"_deposit":{"id":"216079","pid":{"type":"depid","value":"216079","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"CNNの組み合わせ回路実装に向けた重み調整によるLUT数削減手法の検討","author_link":["557310","557309"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"CNNの組み合わせ回路実装に向けた重み調整によるLUT数削減手法の検討"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"再構成回路","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2022-01-17","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学情報科学研究科情報システム工学専攻"},{"subitem_text_value":"京都大学情報学研究科通信情報システム専攻"}]},"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/216079/files/IPSJ-SLDM22197022.pdf","label":"IPSJ-SLDM22197022.pdf"},"date":[{"dateType":"Available","dateValue":"2024-01-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM22197022.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":"843e76ac-d207-486c-bdc0-1bcc2538dcfd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 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":[{}]}]},"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":"近年の FPGA 技術の進歩により積載可能な回路規模が増大している．低レイテンシで高度な画像処理が求められる場合，CNN を組み合わせ回路に実装することが一つの解決策になる可能性がある．演算器を共有し繰り返し利用する一般的な CNN の FPGA 実装に比べ，組み合わせ回路実装は演算を並列に実行するため遅延時間が小さく，重み係数を組み合わせ回路に埋め込むため係数メモリが不要となる利点があるが，論理回路の規模が膨大となる問題がある．そこで係数を埋め込んだ組み合わせ回路の規模が係数に依存することに注目し，推論精度の劣化を抑制しつつ，各係数ごとに量子化ビット数を定めて量子化を行うことで回路規模を削減する手法を検討した．LeNet を用いた評価実験では，畳み込み層において，1.4 ％の精度のペナルティで回路規模を 85 ％削減できるという結果が得られた．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-01-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"22","bibliographicVolumeNumber":"2022-SLDM-197"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":216079,"updated":"2025-01-19T15:56:23.933103+00:00","links":{},"created":"2025-01-19T01:16:48.347906+00:00"}