Search

Article

x

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

Research on the stability of complexity of chaos-based pseudorandom sequence

Luo Song-Jiang Qiu Shui-Sheng Luo Kai-Qing

Research on the stability of complexity of chaos-based pseudorandom sequence

Luo Song-Jiang, Qiu Shui-Sheng, Luo Kai-Qing
PDF
Get Citation
Metrics
  • Abstract views:  3163
  • PDF Downloads:  1103
  • Cited By: 0
Publishing process
  • Received Date:  19 January 2009
  • Accepted Date:  17 February 2009
  • Published Online:  20 September 2009

Research on the stability of complexity of chaos-based pseudorandom sequence

  • 1. 华南理工大学电子与信息学院,广州 510640

Abstract: Intensive statistical complexity can reflect the random nature of chaos-based pseudorandom sequence. Based on this property, the definition of k-error intensive statistical complexity is presented and two basic properties of it are proved in this paper, which can be used to measure the stability of complexity of chaos-based pseudorandom sequences. Based on chaos-based pseudorandom sequences produced via Logistic, Henon, Cubic, Chebyshev and Tent maps, an example is given to demonstrate how it works. Simulation results indicate that the approach is effective, it can distinguish the stability of diverse chaos-based pseudorandom sequences, and is an effective way for evaluating the stability of chaos-based sequences.

Catalog

    /

    返回文章
    返回