Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA
DOI:
https://doi.org/10.1515/ecce-2017-0011Keywords:
Baseband, Binary sequences, Chaotic communication, Communication systems, Direct-sequence code-division multiple access, Minimization, Wireless sensor networksAbstract
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.References
A. Abel and W. Schwarz, “Chaos communications - Principles, schemes, and system analysis,” Proceedings of the IEEE, vol. 90, no. 5. pp. 691–710, May-2002. https://doi.org/10.1109/jproc.2002.1015002
S. M. Berber and F. Shu, “Chaos-Based Physical Layer Design for WSN Applications,” in Proceedings of the 17th International Conference on Communications (part of CSCC’13), 2013, vol. 1, no. 2, pp. 157–162.
D. P. Kong, J. Da Zhu, T. He, and Y. F. Zhou, “The study of chaos encryption algorithm for wireless sensor networks based on the reconfigure technology of FPGA,” J. Chem. Pharm. Res., vol. 6, no. 4, pp. 359–364, 2014.
G. Setti, R. Rovatti, and G. Mazzini, “Synchronization Mechanism and Optimization of Spreading Sequences in Chaos-Based DS-CDMA Systems,” IEICE Trans. Fundam. Electron. Commun. Comput. Sci., vol. E82–A, no. 9, pp. 1737–1746, 1999.
V. Varadan and H. Leung, “Design of piecewise maps for chaotic spread-spectrum communications using genetic programming,” IEEE Trans. Circuits Syst. I Fundam. Theory Appl., vol. 49, no. 11, pp. 1543–1553, Nov. 2002. https://doi.org/10.1109/tcsi.2002.804545
A. Litvinenko and A. Aboltins, “Use of cross-correlation minimization for performance enhancement of chaotic spreading sequence based asynchronous DS-CDMA system,” in 2016 IEEE 4th Workshop on Advances in Information, Electronic and Electrical Engineering (AIEEE), 2016, pp. 1–6. https://doi.org/10.1109/aieee.2016.7821812
J. Jie Yang, M. H. Moon Ho Lee, and M. Mingqi Jiang, “Optimal over sampled chaotic map binary sequences for CDMA,” in 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353), 2002, vol. 2, p. II-289-II-291. https://doi.org/10.1109/iscas.2002.1010981
A. Litvinenko and E. Bekeris, “Correlation properties of binary spreading sequences generated by chaotic logistic map,” Sci. J. RTU, Telecommun. Electron., vol. 9, pp. 39–43, 2009.
A. Litvinenko and E. Bekeris, “Statistical Analysis of Multiple Access Interference in Chaotic Spreading Sequence Based DS-CDMA Systems,” Electronics, vol. 21, no. 1, pp. 34–37, 2017.
A. Litvinenko and A. Aboltins, “Selection and performance analysis of chaotic spreading sequences for DS-CDMA systems,” in 2016 Advances in Wireless and Optical Communications (RTUWO), 2016, pp. 38–45. https://doi.org/10.1109/rtuwo.2016.7821852
Downloads
Published
Issue
Section
License
Copyright (c) 2017 Anna Litviņenko, Artūrs Āboltiņš (Author)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 Unported License.
How to Cite
