Discrete Chaotic Sequence based on Logistic Map in Digital Communications
V. H. Mankar, T. S. Das, S. K. Sarkar

TL;DR
This paper explores the use of discrete chaotic sequences generated from the logistic map for applications in spread spectrum communications and watermarking, highlighting their potential for secure and diverse pseudo-random sequences.
Contribution
It demonstrates the feasibility of using quantized logistic map outputs as chaotic sequences for secure communication and watermarking applications.
Findings
Chaotic sequences exhibit desirable statistical properties.
Generated sequences are suitable for spread spectrum applications.
Potential for enhanced security in communication systems.
Abstract
The chaotic systems have been found applications in diverse fields such as pseudo random number generator, coding, cryptography, spread spectrum (SS) communications etc. The inherent capability of generating a large space of PN sequences due to sensitive dependence on initial conditions has been the main reason for exploiting chaos in spread spectrum communication systems. This behaviour suggests that it is straightforward to generate a variety of initial condition induced PN sequences with nice statistical properties by quantising the output of an iterated chaotic map. In the present paper the study has been carried out for the feasibility and usefulness of chaotic sequence in SS based applications like communication and watermarking.
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
TopicsChaos-based Image/Signal Encryption · Chaos control and synchronization · Mathematical Dynamics and Fractals
