Analysis of Chaotic Complexity Characteristics Based on C<sub>0</sub> Algorithm

SUN Ke-hui; HE Shao-bo; ZHU Cong-xu; HE Yi

doi:10.3969/j.issn.0372-2112.2013.09.015

您当前的位置：

首页 >

文章列表页 >

Analysis of Chaotic Complexity Characteristics Based on C₀ Algorithm

更新时间：2025-07-16

- Analysis of Chaotic Complexity Characteristics Based on C₀ Algorithm
- Acta Electronica Sinica Vol. 41, Issue 9, Pages: 1765-1771(2013)
- 作者机构：
  
  1. 中南大学物理与电子学院,湖南,长沙,410083
  2. 新疆大学物理科学与技术学院,新疆,乌鲁木齐,830046
  3. 中南大学信息科学与工程学院,湖南,长沙,410083
  4. 中南大学物理与电子学院,湖南,长沙,410083
  5. 新疆大学物理科学与技术学院,新疆,乌鲁木齐,830046
  6. 中南大学信息科学与工程学院,湖南,长沙,410083
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61161006, No.61073187)
- DOI：10.3969/j.issn.0372-2112.2013.09.015
  CLC： TN918
- Published：2013
- 稿件说明：
移动端阅览
SUN Ke-hui, HE Shao-bo, ZHU Cong-xu, et al. Analysis of Chaotic Complexity Characteristics Based on C₀ Algorithm[J]. Acta Electronica Sinica, 2013, 41(9): 1765-1771.
DOI：

SUN Ke-hui, HE Shao-bo, ZHU Cong-xu, et al. Analysis of Chaotic Complexity Characteristics Based on C₀ Algorithm[J]. Acta Electronica Sinica, 2013, 41(9): 1765-1771. DOI： 10.3969/j.issn.0372-2112.2013.09.015.

摘要

采用C

复杂度算法

分析了Logistic映射、简化Lorenz系统和超混沌Lorenz系统的复杂度特性

并与系统的Lyapunov指数谱和分岔图进行对比

结果表明

复杂度能正确反映系统的复杂度特性;三系统复杂度从大到小依次为Logistic系统、超混沌Lorenz系统和简化Lorenz系统.将C

复杂度算法与谱熵算法(SE)和强度统计算法(LMC)计算结果对比

进一步说明C

算法分析混沌系统复杂度的有效性.系统复杂度随时间演化的特性分析表明

系统复杂度在一定范围内波动

即系统具有演化稳定性

两连续系统中

序列复杂度最大.为混沌系统应用于信息加密、保密通信领域提供了理论与实验依据.

Abstract

Complexity characteristics of logistic map

simplified Lorenz system and hyper-chaotic Lorenz system are analyzed based on C

algorithm.Compared with the Lyapunov spectrum and bifurcation of the systems

the results show that C

complexity reflects complexity of chaotic systems correctly.Deceasing order on complexity of the systems is logistic map

hyper-chaotic Lorenz system and simplified Lorenz system.Compared the results of spectral entropy(SE)and intensive statistical algorithm(LMC)with that of C

algorithm

it shows that C

algorithm can be used to analyze complexity of chaotic systems effectively.Anal

yses of evolution complexity of time shows that complexity of chaotic systems fluctuates within a certain range which means system has evolution stability

and complexity of sequence

is the biggest anong the sequences of the two continuous chaotic systems.It provides a theoretical and experimental basis for the applications of chaotic systems in the field of information encryption and secure communication.

关键词

Keywords

references

Views

2604

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Study of Image Bit-Plane Complexity in the Information Hiding

Performance Evaluation of the Concatenated Convolutional Codes

Analysis of Chaotic Sequence Complexity Based on Wavelet Packet Energy Entropy

Application of Polynomical Matrix Theory to Analysis of Linear Time-Invariant Active Networks

A Time-Efficient and Easy-to-Implement RFID Technology for Multiple Tags

Related Author

ZHOU Lin-na

ZHANG Chun-tian

YOU Xin-gang

GUO Yun-biao

LIU Gang

GE Jian-hua

LIU Pei

CHEN Zhi-gang

Related Institution

School of Electronic Information EngineeringTianjin UniversityTianjin 300072China

Institute of Electronic Technology Beijing ApplicationBeijing 100091China

School of Electronic Information Engineering, Tianjin University

Institute of Electronic Technology Beijing Application

National Key Lab.of ISN,Xidian Univ.

⁰

Analysis of Chaotic Complexity Characteristics Based on C0 Algorithm

DOI：10.3969/j.issn.0372-2112.2013.09.015

摘要

Abstract

关键词

Keywords

references

Analysis of Chaotic Complexity Characteristics Based on C₀ Algorithm