Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA

Electrical, Control and Communication Engineering 2017
Anna Litviņenko, Artūrs Āboltiņš

The choice of the spreading sequence for asynchronous direct-sequence code-division multiple-access (DSCDMA) 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 inding 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.

Atslēgas vārdi
Baseband; Binary sequences, Chaotic communication; Communication systems; Direct-sequence codedivision multiple access; Minimization; Wireless sensor networks.
DOI
10.1515/ecce-2017-0011

Litviņenko, A., Āboltiņš, A. Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA. Electrical, Control and Communication Engineering, 2017, Vol.13, 75.-80.lpp. ISSN 2255-9140. e-ISSN 2255-9159. Pieejams: doi:10.1515/ecce-2017-0011

Publikācijas valoda
English (en)