Investigation on Complezity Analysis of Chaos-Based Pseudorandom Sequence

摘要：

In this paper, a method is presented to analyze chaos-based pseudorandom sequence and determine its complexity based on intensive statistical complexity measure. For the case of chaos-based sequence and octal chaos-based pseudorandom sequence produced by Logistic map and one-way coupled lattice, an example is made to demonstrate how it works. By improving permutation patterns, this method can be applied to binary chaos-based pseudorandom sequence. Simulations indicate that the method is effective to reflect the complexity of different chaos-based pseudorandom sequences produced by chaotic system, and it is superior to the entropy measure method.

关键词： chaos pseudorandom sequence intensive statistical complezity

作者: Songjiang Luo Shuisheng Qiu Xu Chen

作者单位: School of Electronic and Information Engineering, South China University of Technology Guangzhou, Guangdong 510640, China

会议类型: 国际会议

会议名称: 2009图像分析与信号处理国际会议(2009 International Conference on Image Analysis and Signal Processing)

会议地点: 浙江台州

会议语种:英文

页码: 333-336

在线出版日期: 2009-04-11（万方平台首次上网日期，不代表论文的发表时间）