Chaotic Sequences for Secure CDMA

One family each of repetitive and non-repetitive spreading sequences for secure Direct Sequence Spread Spectrum communication are obtained from the logistic map. The repetitive sequences are perfectly balanced and are found to have sufficient linear complexity. Applicability of both the families to CDMA communication is studied by examining their cross-correlation performance. The cross-correlation is found to be comparable to and only rarely worse than that of Gold sequences.

[1]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[2]  Robert M. May,et al.  Simple mathematical models with very complicated dynamics , 1976, Nature.

[3]  Robert A. Scholtz,et al.  The Spread Spectrum Concept , 1977, IEEE Trans. Commun..

[4]  M.B. Pursley,et al.  Crosscorrelation properties of pseudorandom and related sequences , 1980, Proceedings of the IEEE.

[5]  Clare D. McGillem,et al.  A chaotic direct-sequence spread-spectrum communication system , 1994, IEEE Trans. Commun..

[6]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[7]  Narendra Kumar.  Deterministic chaos: complex chance out of simple necessity , 1996 .

[8]  M. Itoh,et al.  Chaos-based spread spectrum communication systems , 1998, IEEE International Symposium on Industrial Electronics. Proceedings. ISIE'98 (Cat. No.98TH8357).

[9]  Ling Cong,et al.  Chaotic frequency hopping sequences , 1998 .