Electronics, Communication & Automation Technology

A Way to Complexity Analysis of Chaotic Pseudorandom Sequence

Expand
  • School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510640, Guangdong,
罗松江(1973-),男,博士,仲恺农业工程学院讲师,主要从事混沌保密通信研究.

Received date: 2009-01-12

  Revised date: 2009-07-20

  Online published: 2010-01-25

Supported by

国家自然科学基金资助项目(60372004)

Abstract

In order to measure the random essential of chaotic pseudorandom sequences, a method based on the intensive statistical complexity is proposed and is used to analyze the complexity of a chaotic pseudorandom sequence. Then, based on the chaotic sequence and the octal chaotic pseudorandom sequence produced by both the Logistic map and the coupled map lattice, an example is persented to demonstrate how the method works. Moreover, an improvement of permutation patterns is performed to make the method applicable to binary chaotic pseudorandom sequences. Experimental results indicate that the proposed method well presents the related structure and reflects the random essential of the sequence, and that it is suitable for the complexity measurement of different chaotic pseudorandom sequences produced by the chaotic system with simple computation.

Cite this article

Luo Song-jiang Qiu Shui-sheng Chen Xu . A Way to Complexity Analysis of Chaotic Pseudorandom Sequence[J]. Journal of South China University of Technology(Natural Science), 2010 , 38(1) : 18 -21 . DOI: 10.3969/j.issn.1000-565X.2010.01.004

Outlines

/