Journal of South China University of Technology (Natural Science Edition) ›› 2010, Vol. 38 ›› Issue (1): 18-21.doi: 10.3969/j.issn.1000-565X.2010.01.004

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

A Way to Complexity Analysis of Chaotic Pseudorandom Sequence

Luo Song-jiang  Qiu Shui-sheng  Chen Xu   

  1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510640, Guangdong,
  • Received:2009-01-12 Revised:2009-07-20 Online:2010-01-25 Published:2010-01-25
  • Contact: 罗松江（1973-），男，博士，仲恺农业工程学院讲师，主要从事混沌保密通信研究． E-mail:wangxxd@163．com
  • About author:罗松江（1973-），男，博士，仲恺农业工程学院讲师，主要从事混沌保密通信研究．
  • Supported by:

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

PDF

832

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.

Key words: chaos, pseudorandom sequence, intensive statistical complexity