Analysis on Stability of Binary Chaotic Pseudorandom Sequence
Xiang Fei, Qiu Shui-sheng · IEEE Communications Letters · 2008
This paper presents the definition of k-error approximate entropy and proves its two basic properties, which measures the stability of chaotic pseudorandom sequences. Then the stabilities of Logistic, Henon, Tent and Chebyshev maps are evaluated. Simulation results indicate that the approach is effective, which can distinguish the difference of stability of diverse chaotic sequences, and is an effective means for evaluating the stability of chaotic sequences.