<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA

Electrical, Control and Communication Engineering

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The choice of the spreading sequence for asynchronous direct-sequence code-division multiple-access (DS-CDMA) systems plays a crucial role for the mitigation...

Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA

Publié en ligne: 29 déc. 2017

Pages: 75 - 80

DOI: https://doi.org/10.1515/ecce-2017-0011

Mots clés
Baseband, Binary sequences, Chaotic communication, Communication systems, Direct-sequence code-division multiple access, Minimization, Wireless sensor networks

© 2017 Anna Litviņenko et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA

Publié en ligne: 29 déc. 2017

Pages: 75 - 80

DOI: https://doi.org/10.1515/ecce-2017-0011

Mots clésBaseband, Binary sequences, Chaotic communication, Communication systems, Direct-sequence code-division multiple access, Minimization, Wireless sensor networks

© 2017 Anna Litviņenko et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
Baseband, Binary sequences, Chaotic communication, Communication systems, Direct-sequence code-division multiple access, Minimization, Wireless sensor networks