The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences
TD-ERCS离散混沌伪随机序列的复杂性分析

By observing the phase diagram and using the behavior complexity algorithm, the complexity of chaotic pseudo-random sequences generated by the new TD-ERCS discrete chaotic system is analyzed in detail, and the rules of complexity variety are investigated. Based on the Kolmogorov complexity, from one-dimensional time series to multidimensional phase space restructure, the complexity values of TD-ERCS discrete chaotic pseudo-sequences are calculated by using the Limpel-Ziv algorithm, ApEn algorithm and PE algorithm, respectively. The results show that the behavior complexity of TD-ERCS system is high, and the complexity value changes a little with the change of the parameters of TD-ERCS system. TD-ERCS system is a discrete chaotic system with the steady complexity, and the pseudo-random sequences generated by TD-ERCS are suitable for use in information encryption and spread spectrum communications.