一种混沌伪随机序列复杂度分析法

Analysis on the chaotic pseudo-random sequence complexity

分析了已有的序列线性复杂度分析方法 ,提出了用近似熵算法计算混沌运动的测度熵 ,作为衡量混沌伪随机序列复杂度的标准 .理论研究表明 ,利用较短的观察序列 ,该方法能够准确地反映混沌系统和混沌伪随机序列复杂度的大小 ,可以作为判断利用混沌系统产生的伪随机序列的复杂度准则 .实验结果表明该方法的有效性和理论结果的正确性 .

In this paper, the conventional pseudo-random sequence linear complexity is discussed, and a new criterion is proposed, based on the approximate entropy. It is proved that the criterion is able to distinguish different complex chaos and chaotic pseudo-random sequences with short observed sequence. Simulations indicate that the method is effective, and the corresponding theories are proved right.