Journal of Computer Applications

• Information security • Previous Articles     Next Articles

Complexity measure of chaotic pseudorandom sequences

Jin-mei LIU Shui-sheng QIU   

  • Received:2008-10-09 Revised:2008-11-28 Online:2009-04-01 Published:2009-04-01
  • Contact: Jin-mei LIU

混沌伪随机序列复杂性的一种量度方法

刘金梅 丘水生   

  1. 华南理工大学电子与信息学院;暨南大学信息科学技术学院 华南理工大学 电子与信息学院
  • 通讯作者: 刘金梅

Abstract: Based on the concepts of primitive production process and eigenword of sequences, the index in primitive production process (IPP) of sequences was defined for measuring the complexity of chaotic pseudorandom sequences. In comparison with bifurcation curves and approximate entropy of simulation results, the efficiency and advantages of the proposed measure are obvious. IPP is superior to approximate entropy for distinguishing sequence complexity.

Key words: chaos, pseudorandom, primitive production process, approximate entropy

摘要: 基于序列生成过程及特征序列等概念,定义了序列的原生系数来度量混沌伪随机序列的复杂性。仿真结果表明这种量度方法十分有效。利用分岔图和近似熵论证了新量度方法的优点,相对于近似熵,原生系数更能有效地反映序列复杂度。

关键词: 混沌, 伪随机, 原生过程, 近似熵

CLC Number: