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

混沌伪随机序列的复杂度的稳定性研究
引用本文:罗松江,丘水生,骆开庆.混沌伪随机序列的复杂度的稳定性研究[J].物理学报,2009,58(9):6045-6049.
作者姓名:罗松江  丘水生  骆开庆
作者单位:华南理工大学电子与信息学院,广州 510640
基金项目:国家自然科学基金(批准号:60372004)资助的课题.
摘    要:增强统计复杂度能反映混沌伪随机序列的随机本质,在此基础上提出了k错增强统计复杂度的定义,用来衡量混沌伪随机序列复杂度的稳定性,并证明了其两个基本特性.以Logistic,Henon,Cubic,Chebyshev和Tent映射产生的混沌伪随机序列为例,说明了该方法的应用.仿真结果表明,该方法能区分不同混沌伪随机序列的稳定性,是一种衡量混沌序列稳定性的有效方法. 关键词: 稳定性 k错增强统计复杂度')" href="#">k错增强统计复杂度 混沌 伪随机序列

关 键 词:稳定性  k错增强统计复杂度  混沌  伪随机序列
收稿时间:2009-01-19

Research on the stability of complexity of chaos-based pseudorandom sequence
Luo Song-Jiang,Qiu Shui-Sheng,Luo Kai-Qing.Research on the stability of complexity of chaos-based pseudorandom sequence[J].Acta Physica Sinica,2009,58(9):6045-6049.
Authors:Luo Song-Jiang  Qiu Shui-Sheng  Luo Kai-Qing
Abstract:Intensive statistical complexity can reflect the random nature of chaos-based pseudorandom sequence. Based on this property, the definition of k-error intensive statistical complexity is presented and two basic properties of it are proved in this paper, which can be used to measure the stability of complexity of chaos-based pseudorandom sequences. Based on chaos-based pseudorandom sequences produced via Logistic, Henon, Cubic, Chebyshev and Tent maps, an example is given to demonstrate how it works. Simulation results indicate that the approach is effective, it can distinguish the stability of diverse chaos-based pseudorandom sequences, and is an effective way for evaluating the stability of chaos-based sequences.
Keywords:stability  k-error intensive statistical complexity  chaos  pseudorandom sequence
本文献已被 万方数据 等数据库收录!
点击此处可从《物理学报》浏览原始摘要信息
点击此处可从《物理学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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