中国物理B ›› 2023, Vol. 32 ›› Issue (1): 10501-010501.doi: 10.1088/1674-1056/ac785c

• • 上一篇    下一篇

A novel algorithm to analyze the dynamics of digital chaotic maps in finite-precision domain

Chunlei Fan(范春雷) and Qun Ding(丁群)   

  1. Electrical Engineering College, Heilongjiang University, Harbin 150080, China
  • 收稿日期:2022-01-02 修回日期:2022-06-12 接受日期:2022-06-14 出版日期:2022-12-08 发布日期:2022-12-20
  • 通讯作者: Chunlei Fan E-mail:2020021@hlju.edu.cn
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant No. 62101178) and the Fundamental Research Funds for the Higher Institutions in Heilongjiang Province, China (Grant No. 2020-KYYWF-1033).

A novel algorithm to analyze the dynamics of digital chaotic maps in finite-precision domain

Chunlei Fan(范春雷) and Qun Ding(丁群)   

  1. Electrical Engineering College, Heilongjiang University, Harbin 150080, China
  • Received:2022-01-02 Revised:2022-06-12 Accepted:2022-06-14 Online:2022-12-08 Published:2022-12-20
  • Contact: Chunlei Fan E-mail:2020021@hlju.edu.cn
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No. 62101178) and the Fundamental Research Funds for the Higher Institutions in Heilongjiang Province, China (Grant No. 2020-KYYWF-1033).

摘要: Chaotic maps are widely used to design pseudo-random sequence generators, chaotic ciphers, and secure communication systems. Nevertheless, the dynamic characteristics of digital chaos in finite-precision domain must be degraded in varying degrees due to the limited calculation accuracy of hardware equipment. To assess the dynamic properties of digital chaos, we design a periodic cycle location algorithm (PCLA) from a new perspective to analyze the dynamic degradation of digital chaos. The PCLA can divide the state-mapping graph of digital chaos into several connected subgraphs for the purpose of locating all fixed points and periodic limit cycles contained in a digital chaotic map. To test the versatility and availability of our proposed algorithm, the periodic distribution and security of 1-D logistic maps and 2-D Baker maps are analyzed in detail. Moreover, this algorithm is helpful to the design of anti-degradation algorithms for digital chaotic dynamics. These related studies can promote the application of chaos in engineering practice.

关键词: digital chaos, dynamic degradation, state-mapping graph, periodicity analysis

Abstract: Chaotic maps are widely used to design pseudo-random sequence generators, chaotic ciphers, and secure communication systems. Nevertheless, the dynamic characteristics of digital chaos in finite-precision domain must be degraded in varying degrees due to the limited calculation accuracy of hardware equipment. To assess the dynamic properties of digital chaos, we design a periodic cycle location algorithm (PCLA) from a new perspective to analyze the dynamic degradation of digital chaos. The PCLA can divide the state-mapping graph of digital chaos into several connected subgraphs for the purpose of locating all fixed points and periodic limit cycles contained in a digital chaotic map. To test the versatility and availability of our proposed algorithm, the periodic distribution and security of 1-D logistic maps and 2-D Baker maps are analyzed in detail. Moreover, this algorithm is helpful to the design of anti-degradation algorithms for digital chaotic dynamics. These related studies can promote the application of chaos in engineering practice.

Key words: digital chaos, dynamic degradation, state-mapping graph, periodicity analysis

中图分类号:  (Low-dimensional chaos)

  • 05.45.Ac
05.45.Gg (Control of chaos, applications of chaos) 05.45.Mt (Quantum chaos; semiclassical methods)