Search

Article

x

留言板

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

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

A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences

Xiao Fang-Hong Yan Gui-Rong Han Yu-Hang

A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences

Xiao Fang-Hong, Yan Gui-Rong, Han Yu-Hang
PDF
Get Citation

(PLEASE TRANSLATE TO ENGLISH

BY GOOGLE TRANSLATE IF NEEDED.)

Metrics
  • Abstract views:  3341
  • PDF Downloads:  1138
  • Cited By: 0
Publishing process
  • Received Date:  17 December 2003
  • Accepted Date:  18 January 2004
  • Published Online:  16 September 2004

A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences

  • 1. (1)西安交通大学建筑工程与力学学院,西安 710049; (2)中国工程物理研究院,绵阳 610003

Abstract: By considering a chaotic pseudo-random sequence as a symb olic sequence, we present a symbolic dynamics approach for the complexity analys is of chaotic pseudo-random sequences. The method is applied to the cases of Logistic map and one-way coupl ed map lattice to demonstrate how it works, and a comparison is made between it and the approximate entropy method. The results show that this method is app licable to distinguish the complexities of different chaotic pseudo-random seque nces, and it is superior to the approximate entropy method.

Catalog

    /

    返回文章
    返回