Noise robustness condition for chaotic maps with piecewise constant invariant density

Author(s):  
F. Pareschi ◽  
G. Setti ◽  
R. Rovatti
2006 ◽  
Vol 16 (11) ◽  
pp. 3391-3400 ◽  
Author(s):  
FABIO PARESCHI ◽  
RICCARDO ROVATTI ◽  
GIANLUCA SETTI

Chaotic maps represent an effective method of generating random-like sequences, that combines the benefits of relying on simple, causal models with good unpredictability. However, since chaotic maps behavior is generally strongly dependent on unavoidable implementation errors and external perturbations, the possibility of guaranteeing map statistical robustness is of great practical concern. Here we present a technique to guarantee the independence of the first-order statistics of external perturbations, modeled as an additive, map-independent random variable. The developed criterion applies to a quite general class of maps.


2009 ◽  
Vol 2009 ◽  
pp. 1-14 ◽  
Author(s):  
Weihong Huang

A general formulation for multi-branches complete chaotic maps that preserve a specified invariant density is provided and an implication relationship among this class of maps is revealed. Such relationship helps to derive a whole family of complete chaotic maps that preserve not only the same invariant measure but also the same degree of chaos in terms of Lyapunov component.


2008 ◽  
Vol 18 (08) ◽  
pp. 2169-2189 ◽  
Author(s):  
ALAN ROGERS ◽  
ROBERT SHORTEN ◽  
DANIEL M. HEFFERNAN ◽  
DAVID NAUGHTON

In this paper, we give a review of the Inverse Frobenius–Perron problem (IFPP): how to create chaotic maps with desired invariant densities. After describing some existing methods for solving the IFPP, we present a new and simple matrix method of doing this. We show how the invariant density and the autocorrelation properties of the maps can be controlled independently. We also give some fundamental results on switching between a number of different chaotic maps and the effect this has on the overall invariant density of the system. The invariant density of the switched system can be controlled by varying the probabilities of choosing each individual map. Finally, we present an interesting application of the matrix method to image generation, by synthesizing a two-dimensional map, which when iterated, generates a well-known image.


2017 ◽  
pp. 106
Author(s):  
Dhaher Abass Redha ◽  
Marwa Mohamed ali Mohsen
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document