Chaotic Sequences for Secure CDMA
classification
🌊 nlin.CD
keywords
sequencescdmacommunicationcross-correlationfoundrepetitivesecureapplicability
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.