Journal of Computer Applications ›› 2009, Vol. 29 ›› Issue (11): 2946-2947.

• Security of information and network • Previous Articles     Next Articles

Complexity stability of several chaotic pseudorandom sequences

Jin-mei LIU,Shui-sheng QIU   

  • Received:2009-05-27 Revised:2009-07-17 Online:2009-11-26 Published:2009-11-01
  • Contact: Jin-mei LIU

几类混沌伪随机序列复杂度的稳定性

刘金梅1,丘水生2   

  1. 1. 华南理工大学电子与信息学院;暨南大学信息科学技术学院
    2. 华南理工大学 电子与信息学院
  • 通讯作者: 刘金梅
  • 基金资助:
    广东省自然科学基金资助项目

Abstract: Complexity stability of sequences is one of the important characteristics of chaotic pseudorandom sequences. Based on the definition of the index in primitive production process (IPP) of a sequence, the concept of weight IPP was proposed. Moreover, the absolute change and the relative change of IPP were recommended to measure the complexity stability of chaotic pseudorandom sequences and some conclusions were drawn. Numerical simulations on several chaotic pseudorandom sequences indicate that the proposed indices are effective in measuring complexity stability of short chaotic sequences.

Key words: chaos sequence, 0-1 balance degree, approximate entropy, linear complexity

摘要: 序列复杂度的稳定性是反映混沌伪随机序列特性的重要指标之一。在序列原生系数的基础上,提出重量原生系数的定义,并使用原生系数的绝对变化量和相对变化量作为衡量混沌伪随机序列复杂度稳定性的指标,得出了一些相关结论。对几类常用混沌伪随机序列的仿真证明,所提出的衡量指标能够有效区分混沌短序列复杂度的稳定性。

关键词: 混沌序列, 0-1平衡度, 近似熵, 线性复杂度