Chaotic Sequences for Secure CDMA
Madhekar Suneel
TL;DR
This paper introduces chaotic sequences derived from the logistic map for secure CDMA communication, demonstrating their balanced properties and comparable cross-correlation performance to Gold sequences.
Contribution
It presents new chaotic spreading sequences for CDMA, analyzing their properties and cross-correlation, expanding options for secure communication systems.
Findings
Sequences are perfectly balanced with sufficient linear complexity.
Cross-correlation performance is comparable to Gold sequences.
Chaotic sequences are suitable for secure CDMA applications.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Cellular Automata and Applications · Chaos-based Image/Signal Encryption