作　　者： ; ; ; ;

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

出　　处： 《计算机应用》 2007年第8期1952-1954,1958,共4页

摘　　要： 提出了一种利用序列生成的穷尽变化率来判定混沌序列类随机性强弱的方法。计算序列穷尽生成的步数,由序列长度求其穷尽变化率。该方法不需相空间重构,对离散混沌系统和连续混沌系统都适用,对数字混沌保密通信具有现实意义。数值仿真实验表明,此方法能有效地识别不同混沌序列的类随机性强弱。 A method of identifying the strength of random-like property of chaotic sequence was proposed with the rate of exhaustive history in sequence production. The step number of exhaustive history in producing process of a sequence was calculated first, and then the rate of exhaustive history was gotten according to the length of the sequence. The method does not need phase space construction, and is adapted to discrete chaotic system and continual chaotic system. It is more significant in digital chaos secret communication. Simulation result shows that the method is valid to identify the strength of random-hke property of different chaotic sequences.

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

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