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!
|
| _version_ | 1850105875485687808 |
|---|---|
| author | Litviņenko Anna Āboltiņš Artūrs |
| author_facet | Litviņenko Anna Āboltiņš Artūrs |
| author_sort | Litviņenko Anna |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-1e73a29837e448028b4d5ca342b3fbb7 |
| institution | OA Journals |
| issn | 2255-9159 |
| language | English |
| publishDate | 2017-12-01 |
| publisher | Riga Technical University Press |
| record_format | Article |
| series | Electrical, Control and Communication Engineering |
| spelling | doaj-art-1e73a29837e448028b4d5ca342b3fbb72025-08-20T02:38:57ZengRiga Technical University PressElectrical, Control and Communication Engineering2255-91592017-12-01131758010.1515/ecce-2017-0011ecce-2017-0011Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMALitviņenko Anna0Āboltiņš Artūrs1lecturer, Riga Technical Universityassociate professor, Riga Technical UniversityThe 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.https://doi.org/10.1515/ecce-2017-0011basebandbinary sequenceschaotic communicationcommunication systemsdirect-sequence code-division multiple accessminimizationwireless sensor networks |
| spellingShingle | Litviņenko Anna Āboltiņš Artūrs Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA Electrical, Control and Communication Engineering baseband binary sequences chaotic communication communication systems direct-sequence code-division multiple access minimization wireless sensor networks |
| title | Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA |
| title_full | Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA |
| title_fullStr | Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA |
| title_full_unstemmed | Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA |
| title_short | Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA |
| title_sort | computationally efficient chaotic spreading sequence selection for asynchronous ds cdma |
| topic | baseband binary sequences chaotic communication communication systems direct-sequence code-division multiple access minimization wireless sensor networks |
| url | https://doi.org/10.1515/ecce-2017-0011 |
| work_keys_str_mv | AT litvinenkoanna computationallyefficientchaoticspreadingsequenceselectionforasynchronousdscdma AT aboltinsarturs computationallyefficientchaoticspreadingsequenceselectionforasynchronousdscdma |