Search

Article

x

留言板

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

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

Analysis on the chaotic pseudo-random sequence complexity

Cai Jue-Ping Song Wen-Tao Li Zan

Analysis on the chaotic pseudo-random sequence complexity

Cai Jue-Ping, Song Wen-Tao, Li Zan
PDF
Get Citation
Metrics
  • Abstract views:  2860
  • PDF Downloads:  5356
  • Cited By: 0
Publishing process
  • Received Date:  30 September 2002
  • Accepted Date:  13 December 2002
  • Published Online:  20 August 2003

Analysis on the chaotic pseudo-random sequence complexity

  • 1. (1)上海交通大学电子工程系,上海 200030; (2)西安电子科技大学综合业务网国家重点实验室,西安 710071

Abstract: In this paper, the conventional pseudo-random sequence linear complexity is disc ussed, and a new criterion is proposed, based on the approximate entropy. It is proved that the criterion is able to distinguish different complex chaos and cha otic pseudo-random sequences with short observed sequence. Simulations indicate that the method is effective, and the corresponding theories are proved right.

Catalog

    /

    返回文章
    返回