首页 | 本学科首页   官方微博 | 高级检索  
     

TD-ERCS离散混沌伪随机序列的复杂性分析
引用本文:孙克辉,谈国强,盛利元. TD-ERCS离散混沌伪随机序列的复杂性分析[J]. 物理学报, 2008, 57(6): 3359-3366
作者姓名:孙克辉  谈国强  盛利元
作者单位:中南大学物理科学与技术学院,长沙 410083
基金项目:国家自然科学基金(批准号:60672041)资助的课题.
摘    要:采用相空间直接观察法和行为复杂性算法,系统地分析了新型TD-ERCS离散混沌系统产生的伪随机序列的复杂性,得出了其复杂性变化规律.在Kolmogorov复杂性基础上,应用经典的Limpel-Ziv算法,ApEn算法和PE算法,从一维时间序列到多维相空间重构两方面计算了TD-ERCS离散混沌伪随机序列的复杂度大小.计算结果表明,TD-ERCS系统的行为复杂性高,而且该系统的复杂性大小随系统参数改变的变化范围小,是一个复杂性非常稳定的全域性离散混沌系统,其产生的混沌伪随机序列适合于信息加密或扩频通信.关键词:混沌混沌伪随机序列TD-ERCS系统复杂度

关 键 词:混沌  混沌伪随机序列  TD-ERCS系统  复杂度
收稿时间:2007-10-13

The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences
Sun Ke-Hui,Tan Guo-Qiang,Sheng Li-Yuan. The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences[J]. Acta Physica Sinica, 2008, 57(6): 3359-3366
Authors:Sun Ke-Hui  Tan Guo-Qiang  Sheng Li-Yuan
Abstract: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.
Keywords:chaos   chaotic pseudo-random sequence   TD-ERCS system   complexity
本文献已被 万方数据 等数据库收录!
点击此处可从《物理学报》浏览原始摘要信息
点击此处可从《物理学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号