{"_buckets": {"deposit": "5be2af73-3b53-4b3e-b530-317636fa1260"}, "_deposit": {"id": "3866", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "3866"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00003866", "sets": ["314"]}, "author_link": ["9762", "9763"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2000-10", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "10", "bibliographicPageEnd": "1082", "bibliographicPageStart": "1074", "bibliographicVolumeNumber": "49", "bibliographic_titles": [{"bibliographic_title": "IEEE Transactions on computers", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "A digit-recurrence algorithm for computing the Euclidean norm of a three-dimensional (3D) vector which often appears in 3D computer graphics is proposed. One of the three squarings required for the usual computation is removed and the other two squarings, as well as the two additions, are overlapped with the square rooting. The Euclidean norm is computed by iteration of carry-propagation-free additions, shifts, and multiplications by one digit. Different specific versions of the algorithm are possible, depending on the radix, the redundancy factor of the digit set, and etc. Each version of the algorithm can be implemented as a sequential (folded) circuit or a combinational (unfolded) circuit, which has a regular array structure suitable for VLSI.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/5291"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEEE", "subitem_publisher_language": "en"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://doi.org/10.1109/12.888043", "subitem_relation_type_select": "DOI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright c 2005 IEEE. Reprinted from (relevant publication info). This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Nagoya University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "00189340", "subitem_source_identifier_type": "PISSN"}]}, "item_10_text_14": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "高木, 直史", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "9762", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Takagi, Naofumi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "9763", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "00888043.pdf", "filesize": [{"value": "220.6 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 220600.0, "url": {"label": "00888043.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/3866/files/00888043.pdf"}, "version_id": "303a6853-d38e-4a02-8f32-995dc0c653eb"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Computer arithmetic", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Euclidean norm", "subitem_subject_scheme": "Other"}, {"subitem_subject": "VLSI algorithm", "subitem_subject_scheme": "Other"}, {"subitem_subject": "digit-recurrence algorithm", "subitem_subject_scheme": "Other"}, {"subitem_subject": "computer graphics", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "A VLSI algorithm for computing the Euclidean norm of a 3D vector", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "A VLSI algorithm for computing the Euclidean norm of a 3D vector", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/5291", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2006-01-10"}, "publish_date": "2006-01-10", "publish_status": "0", "recid": "3866", "relation": {}, "relation_version_is_last": true, "title": ["A VLSI algorithm for computing the Euclidean norm of a 3D vector"], "weko_shared_id": -1}