改进强度统计算法及混沌序列复杂度分析  

On Improved Intensive Statistical Complexity Algorithm and Complexity Analysis of Chaotic Sequence

作　　者：杨德志[1] YANG De-zhi(Teacher s College, Eastern Liaoning University, Dandong Liaoning 118001, China)

机构地区：[1]辽东学院师范学院

出　　处：《西南师范大学学报（自然科学版）》2019年第9期1-5,共5页Journal of Southwest China Normal University(Natural Science Edition)

摘　　要：在原强度统计算法的基础上,增加了一个条件判断和一个加权值,设计了一种改进的强度统计算法.以超混沌Lorenz系统为例,利用该改进强度统计算法,对超混沌Lorenz系统产生的超混沌、混沌、周期序列的复杂度进行了分析,其结果表明超混沌序列的复杂度大于混沌序列,混沌序列的复杂度大于周期序列.最后,利用该改进强度统计算法对多个混沌和超混沌系统的复杂度进行了分析,得到了相同的结果,验证了该改进强度统计算法的有效性.Considering the issue that intensive statistical complexity algorithm cannot distinguish the complexity of the periodic sequence and the chaotic sequence, an improved intensive statistical complexity algorithm has been presented. Based on the original intensive statistical complexity algorithm, an improved intensive statistical complexity algorithm has been designed via adding a condition judgment and a weight value. Take example for the hyperchaotic Lorenz system, it is analyzed for the complexity of the hyperchaoitc sequence, chaotic sequence and periodic sequence generated by the hyperchaotic Lorenz system, based on the improved intensive statistical complexity algorithm. The results show that the complexity of the hyperchaotic sequence is greater chaotic sequence, and the complexity of the chaotic sequence is greater periodic sequence. At the end, based on the improved intensive statistical complexity algorithm, the complexity of some hyperchaotic systems and chaotic systems is studied. The results show that the complexity of the hyperchaotic sequence is greater chaotic sequence, and the complexity of the chaotic sequence is greater periodic sequence. These results verify the availability of the improved intensive statistical complexity algorithm.

关 键 词：复杂度 强度统计算法 混沌 超混沌LORENZ系统 

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