{"title":"具有马尔可夫链扩展序列的SSMA通信系统误码概率的精确渐近性","authors":"H. Fujisaki","doi":"10.1109/ISSSTA.2008.102","DOIUrl":null,"url":null,"abstract":"In this report we consider asynchronous spread spectrum multiple access (SSMA) communication systems with spreading sequences of Markov chains. By refinement of the large deviations analysis, we obtain exact asymptotics of bit error probabilities in such systems. Comparing theoretical expressions of bit error probabilities with experimental results, we confirm that for too small number of users compared to the length of spreading sequences, the central limit asymptotics become invalid, but the large deviations asymptotics turn out to be relevant.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On Exact Asymptotics of Bit Error Probabilities in SSMA Communication Systems with Spreading Sequences of Markov Chains\",\"authors\":\"H. Fujisaki\",\"doi\":\"10.1109/ISSSTA.2008.102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this report we consider asynchronous spread spectrum multiple access (SSMA) communication systems with spreading sequences of Markov chains. By refinement of the large deviations analysis, we obtain exact asymptotics of bit error probabilities in such systems. Comparing theoretical expressions of bit error probabilities with experimental results, we confirm that for too small number of users compared to the length of spreading sequences, the central limit asymptotics become invalid, but the large deviations asymptotics turn out to be relevant.\",\"PeriodicalId\":334589,\"journal\":{\"name\":\"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSSTA.2008.102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.2008.102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Exact Asymptotics of Bit Error Probabilities in SSMA Communication Systems with Spreading Sequences of Markov Chains
In this report we consider asynchronous spread spectrum multiple access (SSMA) communication systems with spreading sequences of Markov chains. By refinement of the large deviations analysis, we obtain exact asymptotics of bit error probabilities in such systems. Comparing theoretical expressions of bit error probabilities with experimental results, we confirm that for too small number of users compared to the length of spreading sequences, the central limit asymptotics become invalid, but the large deviations asymptotics turn out to be relevant.