Complex Chaotic Attractor via Fractal Transformation

Based on simplified Lorenz multiwing and Chua multiscroll chaotic systems, a rotation compound chaotic system is presented via transformation. Based on a binary fractal algorithm, a new ternary fractal algorithm is proposed. In the ternary fractal algorithm, the number of input sequences is extended...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Entropy (Basel, Switzerland) Ročník 21; číslo 11; s. 1115
Hlavní autori: Dai, Shengqiu, Sun, Kehui, He, Shaobo, Ai, Wei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 14.11.2019
MDPI
Predmet:
Algorithms
Chaos theory
Complexity
Design
Digital electronics
Digital signal processors
Fractal analysis
Fractal transforms
Fractals
Lorenz system
Rotation
Sequences
Variables
ISSN:1099-4300, 1099-4300
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Based on simplified Lorenz multiwing and Chua multiscroll chaotic systems, a rotation compound chaotic system is presented via transformation. Based on a binary fractal algorithm, a new ternary fractal algorithm is proposed. In the ternary fractal algorithm, the number of input sequences is extended from 2 to 3, which means the chaotic attractor with fractal transformation can be presented in the three-dimensional space. Taking Lorenz system, rotation Lorenz system and compound chaotic system as the seed chaotic systems, the dynamics of the complex chaotic attractors with fractal transformation are analyzed by means of bifurcation diagram, complexity and power spectrum, and the results show that the chaotic sequences with fractal transformation have higher complexity. As the experimental verification, one kind of complex chaotic attractors is implemented by DSP, and the result is consistent with that of the simulation, which verifies the feasibility of digital circuit implement.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1099-4300
1099-4300
DOI:10.3390/e21111115