On the Stability of Discrete Chaotic Maps

详细信息    查看全文

• 作者：Ming-Ku Fenga ; Jing-Lin Liub ; ^{liujinglin1964@126.com}
• 关键词：stability ; random-like property ; k-error exhaustive entropy ; discrete chaotic map
• 刊名：Procedia Engineering
• 出版年：2012
• 出版时间：2012
• 年：2012
• 卷：29
• 期：Complete
• 页码：1023-1027
• 全文大小：245 K

文摘

A new approach to the problem of evaluating the stability of discrete chaotic maps is presented. The proposed stability measure is related to the number of steps in a self-delimiting production process, by which a chaotic binary sequence is presumed to be generated. Further related to the number of distinct substrings and the rate of their occurrence along the sequence, the definition of exhaustive entropy (ExEn) and k-error exhaustive entropy is proposed, which measure the strength and the stability of discrete chaotic maps. Then two basic properties of k-error exhaustive entropy are proved. Analysis on the stability of four discrete chaotic maps is evaluated. Simulation results show that the approach is an effective means for measuring the stability of discrete chaos maps.