基于强度统计算法的混沌序列复杂度分析  

Complexity analysis of chaotic sequence based on the intensive statistical complexity algorithm

作　　者：孙克辉[1] 贺少波[1] 盛利元[1] 

机构地区：[1]中南大学物理科学与技术学院,长沙410083

出　　处：《物理学报》2011年第2期90-96,共7页Acta Physica Sinica

基　　金：国家自然科学基金(批准号:60672041)资助的课题~~

摘　　要：为了分析混沌序列的复杂度,文中采用强度统计复杂度算法分别对离散混沌系统(TD-ERCS)和连续混沌系统(简化Lorenz系统)进行复杂度分析,计算了混沌序列随参数变化的复杂度,分析了连续混沌系统产生的伪随机序列分别进行m序列和混沌伪随机序列扰动后的复杂度.研究表明,强度统计复杂度算法是一种有效的复杂度分析方法,离散混沌序列复杂度大于连续混沌序列复杂度,但对连续混沌系统的伪随机序列进行m序列和混沌伪随机序列扰动后可大大增加复杂度,为混沌序列在信息加密中的应用提供了理论依据.To analyze the complexity of the chaotic sequences,based on the intensive statistical complexity algorithm,the complexities of the discrete TD-ERCS and continuous simplified Lorenz chaotic systems were investigated respectively,and the complexities of the chaotic sequences with different system parameters were calculated. The complexities of pseudo-random sequences of the continuous chaotic systems disordered by m-series and chaotic pseudo-random sequences were analyzed. The results indicate that the intensive statistical complexity algorithm is an effective method for analyzing the complexity of the chaotic sequences,and the complexity of the discrete chaotic systems is larger than that of the continuous ones. However,after disordering by m-series or chaotic pseudo-random sequences,the complexities of the pseudo-random sequences can be increased significantly. This study provides a theoretical basis for the applications of chaotic sequences in the field of secure communication and information encryption.

关 键 词：强度统计复杂度算法 TD-ERCS系统 简化Lorenz系统 序列扰动 

分 类 号：O415.5[理学—理论物理]