{"title":"Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA","authors":"A. Litvinenko, A. Aboltins","doi":"10.1515/ecce-2017-0011","DOIUrl":null,"url":null,"abstract":"Abstract The choice of the spreading sequence for asynchronous direct-sequence code-division multiple-access (DS-CDMA) systems plays a crucial role for the mitigation of multiple-access interference. Considering the rich dynamics of chaotic sequences, their use for spreading allows overcoming the limitations of the classical spreading sequences. However, to ensure low cross-correlation between the sequences, careful selection must be performed. This paper presents a novel exhaustive search algorithm, which allows finding sets of chaotic spreading sequences of required length with a particularly low mutual cross-correlation. The efficiency of the search is verified by simulations, which show a significant advantage compared to non-selected chaotic sequences. Moreover, the impact of sequence length on the efficiency of the selection is studied.","PeriodicalId":42365,"journal":{"name":"Electrical Control and Communication Engineering","volume":"13 1","pages":"75 - 80"},"PeriodicalIF":0.5000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electrical Control and Communication Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/ecce-2017-0011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 2
Abstract
Abstract The choice of the spreading sequence for asynchronous direct-sequence code-division multiple-access (DS-CDMA) systems plays a crucial role for the mitigation of multiple-access interference. Considering the rich dynamics of chaotic sequences, their use for spreading allows overcoming the limitations of the classical spreading sequences. However, to ensure low cross-correlation between the sequences, careful selection must be performed. This paper presents a novel exhaustive search algorithm, which allows finding sets of chaotic spreading sequences of required length with a particularly low mutual cross-correlation. The efficiency of the search is verified by simulations, which show a significant advantage compared to non-selected chaotic sequences. Moreover, the impact of sequence length on the efficiency of the selection is studied.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
