Chaos-Based Communication Systems Based on the Sprott D Attractor

摘要

We propose a chaos-based communication system employing the symbolic dynamics of the Sprott D chaotic attractor. The chaotic dynamics is modeled by a graph representing the evolution of the chaotic trajectories. Finite-state encoders are employed to map unrestricted binary sequences in the restricted sequences generated by the discretization of the chaotic flow. Finally, the performance of the proposed system is analyzed.