دانلود کتاب Design of Digital Chaotic Systems Updated by Random Iterations

توضیحاتی در مورد کتاب به زبان اصلی :

This brief studies the general problem of constructing digital chaotic systems in devices with finite precision from low-dimensional to high-dimensional settings, and establishes a general framework for composing them. The contributors demonstrate that the associated state networks of digital chaotic systems are strongly connected. They then further prove that digital chaotic systems satisfy Devaney's definition of chaos on the domain of finite precision. The book presents Lyapunov exponents, as well as implementations to show the potential application of digital chaotic systems in the real world; the authors also discuss the basic advantages and practical benefits of this approach. The authors explore the solutions to dynamic degradation (including short cycle length, decayed distribution and low linear complexity) by proposing novel modelling methods and hardware designs for two different one-dimensional chaotic systems, which satisfy Devaney's definition of chaos. They then extend it to a higher-dimensional digital-domain chaotic system, which has been used in image-encryption technology. This ensures readers do not encounter large differences between actual and theoretical chaotic orbits through small errors. Digital Chaotic Systems serves as an up-to-date reference on an important research topic for researchers and students in control science and engineering, computing, mathematics and other related fields of study.;Intro; Preface; References; Acknowledgements; Contents; Abbreviations; 1 An Introduction to Digital Chaotic Systems Updated by Random Iterations; 1.1 General Presentation; 1.2 Mathematical Definitions of Chaos; 1.2.1 Approaches Similar to Devaney; 1.2.2 Li -- Yorke Approach; 1.2.3 Topological Entropy Approach; 1.2.4 Lyapunov Exponent; 1.3 TestU01; 1.4 Plan of This Book; References; 2 Integer Domain Chaotic Systems (IDCS); 2.1 Description of IDCS; 2.1.1 Real Domain Chaotic Systems (RDCS); 2.1.2 IDCS; 2.2 Proof of Chaos for IDCS; 2.2.1 Dense Periodic Points; 2.2.2 Transitive Property.