期刊文献+

一个新的具有共存隐藏吸引子的四维Sprott B混沌系统

A new four-dimensional Sprott B chaotic system with coexisting hidden attractors
原文传递
导出
摘要 在原Sprott B系统的基础上,采用线性状态反馈控制器,提出了一种新的具有共存隐藏吸引子的四维混沌系统。新的四维混沌系统虽然只有两个非线性项,但它能产生丰富的动力学特性,包括周期吸引子和周期吸引子共存,周期吸引子和混沌吸引子共存,混沌吸引子和混沌吸引子共存。从相图、分岔图、李雅普诺夫指数谱等分析了新混沌系统的动力学特性,通过调节一个控制常数来实现变量的偏置增强。采用模糊熵算法、C0算法和SE谱熵算法验证了系统的复杂度。设计并实现了相应的模拟电路,验证了新的四维混沌系统。 In this paper,based on the original Sprott B system,a new four-dimensional chaotic system with coexisting hidden at-tractors is proposed using a linear state feedback controller.Although the new four-dimensional chaotic system has only two nonlinear terms,it can produce rich dynamical properties,including the coexistence of periodic attractors,coexistence of periodic attractor and chaotic attractor,and coexistence of chaotic attractors.The dynamics of the new chaotic system is analyzed in terms of phase dia-grams,bifurcation diagrams,and Lyapunov exponential spectrums,and the offset boosting of variables is achieved by adjusting the control parameter.The complexity of the system is verified using the fuzzy entropy algorithm,the C0algorithm and the spectral entropy algorithm.The corresponding simulation circuit is designed and implemented to verify the new four-dimensional chaotic system.
作者 李贤丽 于婷婷 王壮 马文峥 LI Xiani;YU Tingting;WANG Yizhuang;MA Wenzheng(School of Physics and Electronic Engineering,Northeast Petroleum University,Daqing,Heilongjiang 163318,China)
出处 《自动化与仪器仪表》 2023年第6期15-21,26,共8页 Automation & Instrumentation
关键词 隐藏吸引子 多稳态 复杂度 电路实现 hidden attractor multistability complexity circuit implementation
  • 相关文献

参考文献10

二级参考文献62

  • 1蔡志杰,孙洁.改进的C_0复杂度及其应用[J].复旦学报(自然科学版),2008,47(6):791-796. 被引量:11
  • 2肖方红,阎桂荣,韩宇航.混沌伪随机序列复杂度分析的符号动力学方法[J].物理学报,2004,53(9):2877-2881. 被引量:26
  • 3沈恩华,蔡志杰,顾凡及.C_0复杂度的数学基础[J].应用数学和力学,2005,26(9):1083-1090. 被引量:13
  • 4李月,路鹏,杨宝俊,赵雪平.用一类特定的双耦合Duffing振子系统检测强色噪声背景中的周期信号[J].物理学报,2006,55(4):1672-1677. 被引量:40
  • 5Parlitz U and Ergezinger S.Robust communication based chaotic spreading sequences[J].Physics Letters A,1994,188(2):146-150.
  • 6Li Zan,Cai Jueping,and Chang Yilin.Determining the complexity of FH/SS sequence by approximate entropy[J].IEEE Transactions on Communications,2009,57(3):812-820.
  • 7Kolmogorov A N.Three approaches to the quantitative definition of information[J].Problems of Information and Transmission,1965,1(1):3-11.
  • 8Lempel A and Ziv J.On the complexity of finite sequences[J].IEEE Transactions on Information Theory,1976,22(1):75-81.
  • 9Ruepple R A.New approach to stream cipher[D].[Ph.D.dissertation],Swiss Federal Institute of Technology,1984.
  • 10Xiao G Z,Wei S M,Kwok Yan Lam,and Kyoki Imamura.A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)[J].IEEE Transactions on Information Theory,2000,46(9):2203-2206.

共引文献88

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部