A Multi-Scroll Memristive Chaotic System via Fractal Process

被引:0
|
作者
Xiao, Liquan [1 ]
Duan, Shukai [2 ]
Wang, Lidan [3 ]
机构
[1] Southwest Univ, Coll Elect & Informat Engn, Chongqing, Peoples R China
[2] Southwest Univ, Natl & Local Joint Engn Lab Intelligent Transmiss, Chongqing, Peoples R China
[3] Southwest Univ, Brain Inspired Comp & Intelligent Control Chongqi, Chongqing, Peoples R China
基金
中国国家自然科学基金;
关键词
fractal process; memristor; chaotic system; multi-scroll memristive chaotic system; ATTRACTORS; GENERATION;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fractal theory is a leading and important branch of nonlinear science, which has been widely studied in many fields in the past few decades. Memristor is a nanoscale element with low power consumption and high integration, when it works as the nonlinear part in a chaotic system, the complexity of the chaotic system will be enhanced. Compared with single-scroll chaotic attractor, multi-scroll chaotic attractor have higher complexity and better adaptability. In this paper, the fractal process is applied to a known memristive chaotic system, which can generate multi-scroll chaotic attractor. At first, a fractal iteration is applied to the memristive chaotic system to generate new chaotic attractor. Secondly, the multi-scroll chaotic system is obtained by combining the Julia fractal and memristive chaotic system. And by changing a complex constant in the fractal process, a fractal graph with different shapes is obtained, which can also be used to generate different chaotic attractors in the generating multi-scroll memristive chaotic system. Compared with other multi-scroll chaotic attractors, the proposed multi-scroll chaotic attractors are easier to adjust the number of the scrolls. It can be seen from the simulation diagram that the size of the system phase diagram becomes smaller and smaller as the number of scrolls increases. The results show that the new system has a lot of dynamic characteristics.
引用
收藏
页码:182 / 187
页数:6
相关论文
共 50 条
  • [31] Generating multi-scroll chaotic attractors via a linear second-order hysteresis system
    Han, FL
    Lü, JH
    Yu, XH
    Chen, GR
    Feng, Y
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 12 (01): : 95 - 110
  • [32] Adaptive generalized synchronization between Chen system and a multi-scroll chaotic system
    谌龙
    史跃东
    王德石
    Chinese Physics B, 2010, 19 (10) : 149 - 151
  • [33] Adaptive generalized synchronization between Chen system and a multi-scroll chaotic system
    Chen Long
    Shi Yue-Dong
    Wang De-Shi
    CHINESE PHYSICS B, 2010, 19 (10)
  • [34] Observation of chaotic and strange nonchaotic attractors in a simple multi-scroll system
    Chithra, A.
    Mohamed, I. Raja
    Rizwana, R.
    JOURNAL OF COMPUTATIONAL ELECTRONICS, 2018, 17 (01) : 51 - 60
  • [35] A New Grid Multi-Scroll Chaotic System and the Simulation Based on Labview
    Huang, Yong
    MATERIALS PROCESSING TECHNOLOGY II, PTS 1-4, 2012, 538-541 : 2666 - 2669
  • [36] Design and FPGA implementation of nested grid multi-scroll chaotic system
    Yu, Guofeng
    Fan, Chunlei
    Xi, Jiale
    Xu, Chengbin
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2024, 36 (08)
  • [37] MULTI-SCROLL CHAOTIC AND HYPERCHAOTIC ATTRACTORS GENERATED FROM CHEN SYSTEM
    Liu, Xinzhi
    Shen, Xuemin
    Zhang, Hongtao
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2012, 22 (02):
  • [38] Observation of chaotic and strange nonchaotic attractors in a simple multi-scroll system
    A. Chithra
    I. Raja Mohamed
    R. Rizwana
    Journal of Computational Electronics, 2018, 17 : 51 - 60
  • [39] Generation of multi-scroll chaotic attractors via the saw-tooth function
    Wang, Fa-Qiang
    Liu, Chong-Xin
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2008, 22 (15): : 2399 - 2405
  • [40] Design of a Multi-scroll Chaotic System and its Application to Image Encryption
    Bai Yulong
    Yang Yang
    Tang Lihong
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2021, 43 (02) : 436 - 444