Search

Article

x

留言板

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

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

The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences

Sun Ke-Hui Tan Guo-Qiang Sheng Li-Yuan

The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences

Sun Ke-Hui, Tan Guo-Qiang, Sheng Li-Yuan
PDF
Get Citation
Metrics
  • Abstract views:  3448
  • PDF Downloads:  992
  • Cited By: 0
Publishing process
  • Received Date:  13 October 2007
  • Accepted Date:  18 November 2007
  • Published Online:  20 June 2008

The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences

  • 1. 中南大学物理科学与技术学院,长沙 410083

Abstract: By observing the phase diagram and using the behavior complexity algorithm, the complexity of chaotic pseudo-random sequences generated by the new TD-ERCS discrete chaotic system is analyzed in detail, and the rules of complexity variety are investigated. Based on the Kolmogorov complexity, from one-dimensional time series to multidimensional phase space restructure, the complexity values of TD-ERCS discrete chaotic pseudo-sequences are calculated by using the Limpel-Ziv algorithm, ApEn algorithm and PE algorithm, respectively. The results show that the behavior complexity of TD-ERCS system is high, and the complexity value changes a little with the change of the parameters of TD-ERCS system. TD-ERCS system is a discrete chaotic system with the steady complexity, and the pseudo-random sequences generated by TD-ERCS are suitable for use in information encryption and spread spectrum communications.

Catalog

    /

    返回文章
    返回