A New CDMA Communication Scheme Using One-Dimensional Chaotic Maps

Conventional CDMA system uses PN sequences to spread user information. The number of shift registers used to generate PN sequences limits the lengths of these sequences. The use of chaotic signals as spectral spreading sequences in directsequence code division multiple access (DSCDMA) systems leads to several improvements in communication security. Among the advantages of the use of chaotic sequences in DS-CDMA is their availability in great numbers, ease of generation, as well as an inherent ability to improve the security of transmission. In this paper, a chaotic CDMA commttnication scheme based on using one-dimensional chaotic maps is proposed. To show the performance of the proposed chaotic communication scheme, a numerical example based on using a Logistic map and also a Chebyshev map is presented. Systern noise and also process noise are considered in simulations. The results presented indicate that the receiver is able to fully recover the transmitted information w ithout any degradation.

Keywords:

Chaos , Spread spectrun , Security , Pseudorandom , Binary sequence