摘要
采用C0复杂度算法,分析了Logistic映射、简化Lorenz系统和超混沌Lorenz系统的复杂度特性,并与系统的Lyapunov指数谱和分岔图进行对比,结果表明,C0复杂度能正确反映系统的复杂度特性;三系统复杂度从大到小依次为Logistic系统、超混沌Lorenz系统和简化Lorenz系统.将C0复杂度算法与谱熵算法(SE)和强度统计算法(LMC)计算结果对比,进一步说明C0算法分析混沌系统复杂度的有效性.系统复杂度随时间演化的特性分析表明,系统复杂度在一定范围内波动,即系统具有演化稳定性,两连续系统中y序列复杂度最大.为混沌系统应用于信息加密、保密通信领域提供了理论与实验依据.
Complexity characteristics of logistic map, simplified Lorenz system and hyper-chaotic Lorenz system are analyzed based on Co algorithm.Compared with the Lyapunov spectrum and bifurcation of the systems,the results show that Co complexity reflects complexity of chaotic systems correctly. Deceasing order on complexity of the systems is logistic map, hyper-chaoticLorenz system and simplified Lorenz system. Compared the results of spectral entropy（ SE ）and intensive statistical algorithm（LMC） with that of Co algorithm, it shows that Co algorithm can be used to analyze complexity of chaotic systems effectively.Analyses of evolu- tion complexity of lime shows that complexity of chaotic systems fluctuates within a certain range which means system has evolution stability, and complexity of sequence y is the biggest anong the sequences of the two continuous chaotic systems. It provides a theo- retical and experimental basis for the applications of chaotic systems in the field of information eneryption and secure communica- lion.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2013年第9期1765-1771,共7页
Acta Electronica Sinica
基金
国家自然科学基金(No.61161006
No.61073187)
