Performance comparison of chaotic spreading sequences generated by 1D and 3D chaotic systems in a chaos-based DS-CDMA system

This paper introduces a new approach that achieves a highly secure transmission at lowest possible performance degradation by employing a chaotic sequence in a DS-CDMA (direct-sequence code division multiple access) system. In the proposed algorithm a binary code is generated by using three-dimensional chaotic systems. Simulation results that are based on a flat-fading channel with additive white Gaussian noise and inter-user interference confirm that the new algorithm outperforms codes generated by other classes of chaotic systems, i.e. the one-dimensional chaotic systems. The results also prove that the proposition´s performance is comparable to those of conventional pseudo-noise (PN) spreading codes, such as the Gold codes, in several key aspects including security of transmission, bit error rate, code generation speed and the number of possible code sequences.