{"created":"2023-07-27T06:26:22.133658+00:00","id":10055,"links":{},"metadata":{"_buckets":{"deposit":"044332e5-4844-48e2-a475-f47963a518e6"},"_deposit":{"created_by":3,"id":"10055","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"10055"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00010055","sets":["934:935:936"]},"author_link":["10716","14852"],"item_4_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2005-10-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicPageEnd":"2676","bibliographicPageStart":"2669","bibliographicVolumeNumber":"E88-A","bibliographic_titles":[{"bibliographic_title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"}]}]},"item_4_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We study asynchronous SSMA communication systems using binary spreading sequences of Markov chains and prove the CLT (central limit theorem) for the empirical distribution of the normalized MAI (multiple-access interference). We also prove that the distribution of the normalized MAI for asynchronous systems can never be Gaussian if chains are irreducible and aperiodic. Based on these results, we propose novel theoretical evaluations of bit error probabilities in such systems based on the CLT and compare these and conventional theoretical estimations based on the SGA (standard Gaussian approximation) with experimental results. Consequently we confirm that the proposed theoretical evaluations based on the CLT agree with the experimental results better than the theoretical evaluations based on the SGA. Accordingly, using the theoretical evaluations based on the CLT, we give the optimum spreading sequences of Markov chains in terms of bit error probabilities. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.","subitem_description_type":"Abstract"}]},"item_4_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学理工研究域電子情報学系","subitem_description_type":"Other"}]},"item_4_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEICE 電子情報通信学会"}]},"item_4_relation_12":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1093/ietfec/e88-a.10.2669","subitem_relation_type_select":"DOI"}}]},"item_4_relation_28":{"attribute_name":"関連URI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.ieice.org/jpn/index.html","subitem_relation_type_select":"URI"}},{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://ci.nii.ac.jp/naid/110003213284","subitem_relation_type_select":"URI"}}]},"item_4_rights_23":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(c) 2005 IEICE 電子情報通信学会"}]},"item_4_source_id_11":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AN10467885","subitem_source_identifier_type":"NCID"}]},"item_4_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0916-8508","subitem_source_identifier_type":"ISSN"}]},"item_4_version_type_25":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Fujisaki, Hiroshi"}],"nameIdentifiers":[{"nameIdentifier":"10716","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"80304757","nameIdentifierScheme":"金沢大学研究者情報","nameIdentifierURI":"http://ridb.kanazawa-u.ac.jp/public/detail.php?kaken=80304757"},{"nameIdentifier":"80304757","nameIdentifierScheme":"研究者番号","nameIdentifierURI":"https://nrid.nii.ac.jp/nrid/1000080304757"}]},{"creatorNames":[{"creatorName":"Yamada, Yousuke"}],"nameIdentifiers":[{"nameIdentifier":"14852","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-10-03"}],"displaytype":"detail","filename":"TE-PR-YAMADA-Y-2669.pdf","filesize":[{"value":"921.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"TE-PR-YAMADA-Y-2669.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/10055/files/TE-PR-YAMADA-Y-2669.pdf"},"version_id":"a427004e-e08a-4634-bca6-9cb08e3e6275"}]},"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":"On bit error probabilities of SSMA communication systems using spreading sequences of Markov chains","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"On bit error probabilities of SSMA communication systems using spreading sequences of Markov chains"}]},"item_type_id":"4","owner":"3","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-10-03"},"publish_date":"2017-10-03","publish_status":"0","recid":"10055","relation_version_is_last":true,"title":["On bit error probabilities of SSMA communication systems using spreading sequences of Markov chains"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2024-06-20T06:23:09.798100+00:00"}