Computationally efficient chaotic spreading sequence selection for asynchronous DS-CDMA

Anna Litvinenko, Arturs Aboltins


Choice of the spreading sequence for asynchronous in direct-sequence code-division multiple access (DS-CDMA) systems plays a crucial role for mitigation of multiple access interference. Considering rich dynamics of chaotic sequences, use of them for spreading allows to overcome 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 to find sets of chaotic spreading sequences of required length with particularly low mutual cross-correlation. Efficiency of the search is verified by simulations, which show significant advantage compared to non-selected chaotic sequences. Moreover, impact of sequence length on the efficiency of the selection studied.


Communication systems; Baseband; Wireless sensor networks; Minimization; Chaotic communication; Binary sequences; Direct-sequence code-division multiple access


  • There are currently no refbacks.

Developed by Institute of Industrial Electronics and Electrical Engineering of RIGA TECHNICAL UNIVERSITY