收稿日期: 2009-01-12
修回日期: 2009-07-20
网络出版日期: 2010-01-25
基金资助
国家自然科学基金资助项目(60372004)
A Way to Complexity Analysis of Chaotic Pseudorandom Sequence
Received date: 2009-01-12
Revised date: 2009-07-20
Online published: 2010-01-25
Supported by
国家自然科学基金资助项目(60372004)
罗松江 丘水生 陈旭 . 一种混沌伪随机序列复杂度分析方法[J]. 华南理工大学学报(自然科学版), 2010 , 38(1) : 18 -21 . DOI: 10.3969/j.issn.1000-565X.2010.01.004
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
/
| 〈 |
|
〉 |