科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2008-5
- 单位华南理工大学
