Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Riga Technical University Press
2017-12-01
|
| Series: | Electrical, Control and Communication Engineering |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/ecce-2017-0011 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2255-9159 |