作　　者： ; ; ; ;

机构地区： 华南理工大学电子与信息学院

出　　处： 《系统工程与电子技术》 2008年第5期968-972,共5页

摘　　要： 提出了用穷尽熵来判定离散混沌序列类随机性强弱的算法。对于给定离散混沌序列,求其穷尽生成的步数,根据每个穷尽组成部分的序列数占总序列长度的比率,计算离散混沌序列的穷尽熵。数值仿真实验表明此方法能有效识别不同离散混沌序列的类随机性强弱,在数字混沌保密通信中具有实际应用前景。 Exhaustive entropy is proposed to identify the strength of random-like property of discrete chaotic sequences. With regard to certain discrete chaotic sequences, the step number of exhaustive history in production process is calculated firstly, then the percentage of each exhaustive comment is determined according to the length of the sequence, and exhaustive entropy ofthe discrete chaotic sequences is obtained. Simulation results show that the method is valid for identification the strength of random-like property of different chaotic sequence, h has practical application prospect in digital chaos secure communication.

关 键 词： 混沌 类随机性 序列的生成和再生 穷尽熵

领　　域： [自动化与计算机技术] [自动化与计算机技术] [理学] [理学]