Analysis of Chaotic Complexity Characteristics Based on C_0 Algorithm

Complexity characteristics of logistic map, simplified Lorenz system and hyper-chaotic Lorenz system are analyzed based on C0algorithm.Compared with the Lyapunov spectrum and bifurcation of the systems, the results show that C 0 complexity reflects complexity of chaotic systems correctly.Deceasing order on complexity of the systems is logistic map, hyper-chaotic Lorenz system and simplified Lorenz system.Compared the results of spectral entropy( SE) and intensive statistical algorithm( LMC) with that of C 0 algorithm, it shows that C 0 algorithm can be used to analyze complexity of chaotic systems effectively.Analyses of evolution complexity of time shows that complexity of chaotic systems fluctuates within a certain range which means system has evolution stability, and complexity of sequence yis the biggest anong the sequences of the two continuous chaotic systems.It provides a theoretical and experimental basis for the applications of chaotic systems in the field of information encryption and secure communication.