Nonlinear Dynamics

, Volume 94, Issue 4, pp 2979–2993 | Cite as

Parameter estimation for 1D PWL chaotic maps using noisy dynamics

  • Dhrubajyoti DuttaEmail author
  • Rajlaxmi Basu
  • Soumitro Banerjee
  • Violeta Holmes
  • Peter Mather
Open Access
Original Paper


Many physical situations involve chaotic systems implemented in hardware. Among them one-dimensional piecewise linear maps are popular candidates for such applications because of their property of generating robust chaos. In physical implementations, the control parameter of these maps may deviate from its ideal value due to hardware imprecision. Since the dynamics of a chaotic map is completely defined by its control parameter, one needs to know the value of the parameter in a hardware realisation. In this paper, we show that it is possible to determine the parameter, through the realisation of the unstable fixed point of the map, by utilising noise that is always present in the system. We present this in the form of an algorithm and demonstrate its efficacy through simulated results. We also determine the bounds on the signal-to-noise ratio required for successful parameter estimation. The proposed approach is expected to be beneficial to the existing noise reduction techniques and time series recovery algorithms that require a reasonably accurate knowledge of the map.


Dynamic noise Parameter estimation Reduced height map Fixed point estimates 

1 Introduction

Chaotic maps have found use in applications like data encryption, cipher key generation in communication, dynamical systems synchronisation and control, and signal processing, to name a few. One-dimensional (1D) piecewise linear (PWL) maps, a sub-class of chaotic functions, are especially popular in practical applications owing to their simplicity and ease of implementation in the physical domain. In particular, certain maps belonging to this class are extensively studied and applied for their uniformly dense chaotic behaviour over a wide range of parametric values, referred to as ‘robust chaos’ [1]. Such maps have therefore received considerable attention for use in applications involving physical implementations [2, 3, 4, 5, 6].

The control parameter is one of the central elements of the chaotic functions, whose estimation is necessary for the specific knowledge of the resultant dynamical behaviour. There are some robust techniques available that use either time series trajectories [7, 8] or the equivalent symbolic sequences [9] to decipher the dynamic behaviour of the map, thereby determining the control parameter that result in such behaviour. However, such techniques often do not consider the inevitability of the noise introduced in certain implemented scenarios that results into complete digression of system trajectories from the expected one [10]. In fact, in some cases, the severity of the noise can lead to outcomes bearing little or no resemblance to the actual system behaviour [11, 12].

Distinguishing meaningful information from the distorted dynamics is crucial and can be computationally intensive. The contributions in [13, 14, 15] offer significant reduction of the noise with efficient reconstruction of the dynamical phase space manifolds, consistently highlighting the importance of either determining the noise level in the system or approximating the source function as a priori information so that either of the two information can be utilised to distinguish the other. In this paper, we study the dynamics of noise-affected 1D PWL maps and propose an innovative technique utilising Cartesian coordinate geometry to identify the control parameter of the map, consequently this knowledge of the control parameter can significantly reduce the computational steps involved in approximation of the source function.

Many studies have been conducted to broadly understand the effect of noise on the chaotic dynamics [16, 17, 18]. Noise and chaotic trajectories are both wideband signals; therefore, linear filtering techniques (e.g. low-pass, bandpass filters) or classical Fourier approaches cannot be applied to reduce noise, as meaningful trajectories might also be barred by the filtration [19, 20]. Thus, eliminating noise in order to discern the actual system trajectories is a non-trivial problem and is approached algorithmically.

Works by Kostelich [21], Schreiber [13] and Grassberger et al. [15] formed the basis of the subsequent developments in the noise treatment approaches and have been well summarised by Kostelich and Schreiber in [22] through a qualitative comparison assessing the suitability of the most prevalent techniques for various application scenarios. One such technique is source function approximation which uses least squares approach for local linear approximations (Eckmann–Ruelle linearisation) [23] of the dynamics at each point of the attractor. The accuracy of such approaches depends on how appropriately the dynamics can be described by the chosen linear function. Similar approximation techniques like global function fits also depend on the appropriate choice of the basis functions [22, 24].

Adaptive thresholding is also a commonly used approach that uses threshold functions to determine wavelet coefficients of the noisy signal, depending on the energy distributions in each set of samples, since energies of chaotic segments are comparable to noise. Such a method has been described in [25] that applies different threshold coefficients adaptively according to the detailing of the decomposed signal-scale coefficients. Adaptive thresholds can also be estimated with optimisation techniques like genetic algorithm as shown by Han and Chang [26].

Another popular approach is to determine maximum likelihood, where the noisy trajectories are compared with a noise free reference orbit, as demonstrated by Marteau and Abarbanel in [27]. Similarly works by Schweizer and Schimming [28] shows how least square estimates between the expectation and the observation can be used as likelihood cost function. However, to determine the expectation, the knowledge of either the actual trajectory or the noise level in the system is necessary. Also, most of the noise reduction and phase space reconstruction problems are simultaneously addressed through multidimensional delay embedding techniques that are fundamentally based on Takens’ embedding theorem [19], which is only applicable to the systems with higher (greater than two) Euclidean dimensions [11, 29].

From the mentioned techniques, it is understood that a number of the approaches depend either on good approximation of the source function, or determination of the thresholds between noisy and deterministic data that involve several layers of pre-processing stages, thus may add to the cost of computation as a trade-off. On the other hand, the likelihood estimation approaches demand prior information of the noise level or complete knowledge of the source function where by “complete knowledge” it is expected of one to know the chaotic system in full detail including the control parameter. Hence, if the information of the control parameter can be extracted from the noisy trajectories, then a considerable amount of information regarding the actual dynamics and the initial conditions can be successfully retrieved and it can be of additional support to the existing noise reduction techniques to improve accuracy.

In this paper, we investigate the behaviour of the noisy dynamics of 1D PWL maps under different parametric conditions. From the collective observations of highly distributed trajectories over the state space, as is the case with the noise-affected dynamics, we notice a unique dynamical property demonstrated by the iterates originating within a wide neighbourhood of the fixed point of the map. Knowing the magnitude and time coordinates of the iterative samples, we propose a geometric view of the iterates on a two-dimensional Cartesian coordinate system. We apply linear constructions between consecutive iterates within the set of collected samples whose solutions correspond to a unique point that we mathematically establish as having direct correspondence with the fixed point and control parameter of the map. Hence, the property can be utilised to determine the system parameter from the collection of noisy dynamics of the system.

In Sect. 2, we present the contextual overview of 1D PWL maps and suitable sampling techniques that will be required for the observations regarding the noisy dynamics. In Sect. 3, we show in detail how the dynamical noise within the system affects the trajectories and makes them spread all over the state space through the dynamics of tent map considering it as a typical example of 1D PWL maps. We establish the observed properties in Sect. 4, which we further utilise in Sect. 5 to formulate a method to estimate the parameter of the maps considered. We verify the efficacy of the proposed technique for the candidates of 1D PWL maps through simulation results. In Sect. 6, we add some final comments and concluding remarks about the proposed technique.

2 Context

1D PWL maps given by f are composed of a set of linear functions defined over segments of a one-dimensional state space. Each of the linear segments is limited by contiguous restrictions that together constitute the invariant interval or the state space I. The dynamics of \(f\left( {x_n } \right) =x_{n+1} \, \in \, I \, \subset \, {\mathbb {R}}\) is an iterative self-map such that \(f:I\,\rightarrow \,I\), whose resulting discrete time series is given by \(\,{{\mathcal {X}}}\,=\left\{ {x_n \,|\,n=0,\,1,\,\ldots ,\,N-1} \right\} \) for N iterations and can be treated as the trajectory of the map over time.

Among the 1D PWL maps, the tent map (both symmetric and skew), the zigzag map and Bernoulli shift map are the are the common examples, as these maps are widely used in various areas of application. First, we consider symmetric tent map \(T\left( {x_n } \right) \) [3] to observe the behaviour of noise-affected chaotic dynamics and investigate the properties of the noisy iterates reflecting upon the maps fixed points and the parameter. Later we adapt the estimation technique for the other 1D PWL maps. The tent map is defined by (1) over \(I =[0,1]\) and the dynamics of T depends on the height or the control parameter of the map, given by \(\mu \,\in \, [0,1]\), and critical point of T is \(x_{c} = 0.5 \,\in \, I\).
$$\begin{aligned} x_{n+1} =T\left( {x_n } \right) =\left\{ {{\begin{array}{ll} 2\mu x_n &{}\quad 0\le x_n \le x_c \\ 2\mu \left( {1-x_n } \right) &{}\quad x_c <x_n \,\le 1\\ \end{array} }} \right. \end{aligned}$$
\(T\left( {x_n } \right) \) exhibits chaotic behaviour for \(\mu \,\in \,(0.5,1]\). The discrete time trajectory of an input or initial condition \(x_0 \,\in \, I\) has the following properties.
  1. 1.


  2. 2.


  3. 3.


  4. 4.

    \(T_{\mathrm{max}}\,=\,T(x_{c})\,=\,2{\mu x}_{c} \,=\,\mu \,\le \,1\), where \(T_{\mathrm{max}}\) is the maximum height of the map, for \(0.5\,<\,{\mu }\,\le \,1\)

  5. 5.

    \(\,x_{f} \,=\,T(x_{ f})\,=\,2\mu \left( {1-x_{f} } \right) \), where \(x_{f} \) is the nonzero fixed point

There are two fixed points in the state space I such that \(x_{n+1}\,=\,x_n\). One such fixed point is evidently \(T(0)\,=\,0\). The other is the nonzero fixed point is given by
$$\begin{aligned} x_{f} =2\mu /\left( {1+2\mu } \right) \end{aligned}$$
The folding nature of the tent map ensures that every point in the invariant interval I maps arbitrarily close to every other point in I [30]. When chaotic maps are implemented physically, the feedback process of the original dynamics of \(\,{{\mathcal {X}}}\,\) trajectories becomes significantly affected by the noise induced through the system hardware. Noise-affected chaotic trajectories consist of a deterministic part and a random part, intrinsic to the physical system that affects the entire dynamics at every iterative state. Such types of noise can be described as dynamical noise [10], whose evolution is given by Open image in new window , where Open image in new window is the uncorrelated random perturbations at every step of iteration. The trajectory of such noisy dynamics is defined as Open image in new window .
Fig. 1

Dynamics of T getting affected by noise in every stage of iteration and are sampled for each n successively; the noisy trajectory thus generated are sampled M times

The distribution of the random variables Open image in new window from an unknown source can be best emulated by Gaussian distribution, commonly referred to as additive white Gaussian noise (AWGN) due to its intrinsically additive nature. The AWGN with a zero mean is characterised by signal-to-noise ratio (SNR) of Open image in new window measured in dB, with \(\sigma _x \) and Open image in new window as the standard deviations of the signal and the noise, respectively. To investigate the behaviour of the noisy dynamics, we collect M samples of \(\upeta \) trajectories. Therefore, each of the sampled trajectories (as shown in Fig. 1) can be represented as Open image in new window where \(m=0,\,1,\,\ldots ,\,M-1\). For any m, we record each nth iterate through all the N iterations and then for the next \((m+1)\)th sample, we start from Open image in new window again through to Open image in new window .

As summarised in [22], a noise reduction method must estimate the dynamical quantities of the function under operation. Even when the chaotic function is known, the true dynamics of the system can only be ascertained when some knowledge about the control parameter is also available.

3 Behaviour of the chaotic trajectories when affected by noise

For any perturbed point Open image in new window iterative transformation Open image in new window leads to diverging paths, that is further deviated from the actual \(x_{n+1} = f(x_n )\), at the rate given by the Lyapunov exponent Open image in new window . For the tent map, as long as the control parameter belongs within its ergodic range, i.e. \(\mu \,\in \, (0.5,1]\) and Open image in new window i.e. \(\lambda \) is positive, the trajectories will be divergent in nature, similar to what is also experienced when random perturbations Open image in new window is introduced in every iteration. Figure 2 shows this divergence within a short length \((N\,=\,5)\) trajectory of an arbitrary initial condition for \(M\,=\,10\) samples.
Fig. 2

Collective view of divergent noisy trajectories of an initial condition \(x_0\,=\,0.3234\) iterated through T up to N \(=\) 5 with an arbitrary choice of \(\mu \,=\,0.825\). Also, noise level of SNR \(=\) 30 dB was added to every iterate and \(\upeta ^{m}\) trajectories were collected for \(M\,=\,10\) observations

Fig. 3

The \(\upeta ^{m}\) trajectories for, \(x_0 \,=\,0.3234\), \({\mu }\,=\,0.825\), \(N\,=\,20\), SNR \(=\) 30 dB and \(M\,=\,50\) are shown

Fig. 4

For two different values of \(\mu \) with same level of noise 25 dB in the system for the same \(x_0\,=\,0.3234\), the clusters have appeared around the corresponding fixed point \(x_{f} \), marked with dashed lines, a for \(\mu \,=\,0.825\) around \(x_{f}\,=\,0.6226\) and b for \(\mu \,=\,0.625\) around \(x_{f} \,=\,0.5745\), respectively

The \(\upeta ^{m}\) sample trajectories diverge away from each other and the Open image in new window points become eventually distributed over the state space \(I=\left[ {0,1} \right] \). As can be seen from Fig. 3, when larger set of M trajectories are observed collectively for a higher N, the \(\upeta ^{m}\) are found to be densely distributed over I. We notice that when consecutive iterates Open image in new window and Open image in new window are connected by straight lines, dense clusters of intersections appear in a concentrated neighbourhood between the majority of the nth and \((n+1)\)th iterates.

We find that such clusters of intersections (or crossovers) majorly appear at about the same level on the Y-axis, conveniently around the nonzero fixed point \(x_{f}\). We also verified that any variation in \(\mu \) is reflected on the positions of the clusters. Figure 4 shows that the positions of the intersection clusters have appeared at different levels for the two cases of \(\mu \), simulated for the same \(x_0 \) perturbed with same level of noise (SNR = 25 dB). Based on these observations, we study the intersections of the straight lines that are formed between the iterates and investigate their appearance around the neighbourhood of the nonzero fixed point \(x_{f}\).

4 Dynamics in the neighbourhood of the nonzero fixed point

In order to realise the properties of the intersection clusters (crossovers), we explore the dynamics of the map around \(x_{f} \). For any parameter \(\mu \,\in \, (0.5,1]\), there exists a preimage of \(x_{f}\) (apart from \(T(x_{f})=x_{f})\), given by \(x_p \,=\,x_{f} /2\mu \). We identify four intervals \([0,x_{p}), [x_{p},x_c), [x_c ,x_{f})\) and [\(x_{f},1\)], with distinctive mapping characteristics centred around \(x_{f}\). For any \(x_n \, \,\in \, [0,x_{p} )\,\subset \,I\), the corresponding \(x_{n+1}\) will not exceed \(x_{f}\), thus resulting into the mapping \(T : [0,x_{p} )\,\mapsto [0,x_{f} )\). On the contrary, for any \(x_n \,\in \, [x_{p} ,1]\,\subset \,I\), the corresponding \(x_{n+1}\) will map past \(x_{f} \) on either sides, as given by the mappings \(T : [x_{p},x_c )\,\mapsto \,[x_{f} ,\mu )\), \(T : [x_c ,x_{f} )\,\mapsto \,[x_{f},\mu )\) and \(T : [x_{f} ,1]\,\mapsto \,[0,x_{f}]\).
Fig. 5

a Straight lines formed by the originating points \(x_n \,\in \, [0,x_{p})\), \(x_n \,\in \, [x_{p} ,x_c)\), \(x_n \,\in \,[x_c ,x_{f} )\), \(x_n \, \in \,[x_{f} ,1]\) and their corresponding \(x_{n+1} \) points. The lines formed by \(x_n\, \in \,[x_c ,1]\) intersect at a single point, whereas the remaining intersections formed by other \(x_n \) are spread over. b Similarly, straight lines formed by joining the coordinates of two arbitrary points \(x_n \,=\,(x_c +\,d)\, \in \, [x_c ,1]\) and \(x_n^{\prime } \,=\,(1 - {d}') \,\in \, [x_c ,1]\)

If we have access to any \((x_n ,x_{n+1} )\) pair, we can also represent the points through a two-dimensional cartesian coordinate system XY, where the X-axis represents n and \(n\,+\,1\), and the Y-axis represents \(x_n\) and \(x_{n+1}\), and one can construct a straight line through coordinates \((n,x_n)\) and \((n\,+\,1,x_{n+1})\). We therefore observe, how the straight lines formed by each corresponding pair of \(x_n\) and \(x_{n+1}\) interact, for all the \(x_n \) points originating within I. We show the line plots for a few points \(x_n \, \in \, [0,1]\) and their corresponding \(x_{n+1}\) iterates in Fig. 5a. Evidently, the mapping \(T : [0,x_{p} )\,\mapsto \, [0,x_{f})\) has no contribution in the crossovers that form around \(x_{f}\). Based on \(T : [x_c ,x_{f})\,\mapsto \, [x_{f} ,\mu )\) and \(T : [x_{f} ,1]\,\mapsto \, [0,x_{f}]\), and from the observation in Fig. 5a, it can be stated that the straight lines connecting \(x_n \, \in \, [x_c ,1]\, \in \, I\) and their corresponding \(x_{n+1}\) intersect at a single point (that is the \(x_{f}\) of the map), on the Y-axis. For the remaining \(x_n\, \in \, [x_p ,x_c)\) points, even though the corresponding \(x_{n+1} \) maps beyond \(x_{f}\), any intersections with them are spread over a wide range on the XY-plane instead of being concentrated on a single one.

To validate our statement, we consider a further generic situation. Let there be two arbitrary points \(x_n \, \in \, [x_c ,1] \, \in \, I\) and \(x_n^{\prime } \, \in \,[x_c ,1]\, \in \,I\), with their corresponding next iterates given by \(x_{n+1} =T\left( {x_{n} } \right) \) and \(x_{n+1}^{\prime } =T\left( {x_n^{\prime } } \right) \). If we construct two straight lines by connecting the coordinates \((n,x_n)\) with \((n\,+\,1,x_{n+1})\) and (n,\(x_n^{\prime } )\) with \((n\,+\,1,x_{n+1}^{\prime })\) on the XY-plane, then we can propose the following:

Theorem 1

For any two points \(x_n \, \in \,[x_c ,1]\) and \(x_n^{{\prime }}\, \in \,[x_c ,1]\) such that \(x_n\ne x_n^{{\prime }}\), and their respective iterates \(x_{n+1} \) and \(x_{n+1}^{{\prime }}\), suppose n and \(n\,+\,1\) are plotted on the X-axis and \(x_n\), \(x_{n+1}\), \(x_n^{{\prime }}\), and \(x_{n+1}^{{\prime }} \) are plotted on the Y-axis. Then the lines joining the coordinates \((n,x_n)\) with \((n\,+\,1,x_{n+1} )\), and \((n,x_n^{{\prime }})\) with \((n\,+\,1,x_{n+1}^{{\prime }})\) always intersect each other at a point whose Y-coordinate will be equal to the value of \(x_{f}\), the nonzero fixed point.


Let there be two points \(x_n \,=\,(x_c +\,d)\) and \(x_n^{\prime } \,=\,(1 - {d}')\); arbitrary distances d and \({d}'\) away from \(x_c\) and 1, respectively, such that \(x_n \,\in \,[x_c ,1]\), \(x_n^{\prime }\,\in \,[x_c ,1]\) and \(x_n \ne x_n^{\prime }\). Therefore, the iterates of the chosen points will be, \(x_{n+1}\,=\,T(x_c +\,d)\,=\,\mu - 2\mu d\), and \(x_{n+1}^{\prime }\,=\,T(1 - {d}')\,=\,2\mu d'\) from the properties of the tent map described in Sect. 2.

Fig. 6

Distribution of \(Y^{k}\) solutions between n and corresponding \(n+1\) time steps for \(\upeta ^{m}\) trajectories have been shown a for \(n\,=\,16\) whose mean \({\bar{Y}}_{16}\,=\,0.588973039\) and standard deviations \(D_{16}\,=\,0.090581987\), b for \(n\,=\,20\) with \({\bar{Y}}_{20}\,=\,0.588029146\) and \(D_{20}\,=\,0.079790657\) are the close approximations of the \(x_{f}\,=\,0.5884770\) corresponding to the chosen case of \(\mu \,=\,0.715\)

We represent the pairs of the points on a two-dimensional cartesian coordinate system (XY) as, (\((n,x_c +\,d)\), \((n+1,\mu - 2\mu d))\), and \(((n,1 - {d}'), (n+1,2\mu d'))\). Joining the pairs of nth and the corresponding \((n+1)\)th points as shown in Fig. 5b, the equations representing the two straight lines are given by (3) and (4).
$$\begin{aligned}&\frac{Y-(x_c +d)}{\left( {\mu -2\mu d} \right) -(x_c+d)}=\,\frac{X-n}{n+1-n} \end{aligned}$$
$$\begin{aligned}&\frac{Y-\left( {1-{d}'} \right) }{2\mu {d}'-(1-d')}=\, \frac{X-n}{n+1-n} \end{aligned}$$
Since the ordinate value of the point, where the straight lines intersect, gives us the view of the phenomenon, solving only for Y solutions will suffice for our purpose. Equating (3) and (4), we can write
$$\begin{aligned} \frac{Y-(x_c +d)}{\left( {\mu -2\mu d} \right) -(x_c +d)}=\frac{Y-\left( {1-{d}'} \right) }{2\mu {d}'-(1-d')} \end{aligned}$$
Putting \(x_c\,=\,1/2\) in (5) and solving for Y
$$\begin{aligned}&\Rightarrow \frac{Y-\left( {\frac{1}{2}+d} \right) }{\left( {\mu -2\mu d} \right) -\left( {\frac{1}{2}+d} \right) }=\frac{Y-\left( {1-{d}'} \right) }{2\mu {d}'-(1-d')} \\&\Rightarrow Y=\frac{2\mu }{1+2\mu } \end{aligned}$$
from (2) we can write
$$\begin{aligned} Y=\frac{2\mu }{1+2\mu }=x_{f} \end{aligned}$$
Hence, the proof is complete.

It is thus confirmed that for \(x_n\,\in \, [x_c ,1]\,\in \,I\), i.e. 50% of the possible points within the state space I, will have the straight lines formed with their corresponding \(x_{n+1}\) intersecting at the same point \(x_{f}\).

5 Parameter estimation from the noisy trajectories

From Theorem 1 and previous observations, it is now evident that location of the nonzero fixed point of the map can be identified from the intersections (Y solutions of (5)) exhibited by straight lines formed between Open image in new window and Open image in new window samples of the noisy distribution of trajectories. We apply the proposed idea to determine the parameter from the noisy dynamics of the tent map and eventually adapt it for the other maps.

For the tent map, we intend to determine a point within the concentrated neighbourhood of crossovers, as the closest estimate of \(x_{f} \), which in turn, is indicative of the map parameter as given by (2). To determine the intersections of the straight lines formed between the nth and \(\left( {n+1} \right) \)th iterates, we select the set of points, Open image in new window . For any \(H_n\), let the total number of selected points out of M samples be \({M}' \le M\) implying that \({M}'\) number of straight lines can be formed with each element in \(H_n\) with their corresponding \(\left( {n+1} \right) \)th iterates. We can therefore solve for the intersections between straight lines formed by the unique pairs of points Open image in new window and Open image in new window for the \({M}'\) selected cases. Thus, for all i and j such that \(i\ne j\), there will be \({M}'({M}' - 1)/2\) number of intersections whose solutions of the ordinate value \(Y^{k}\) is given by rewriting (5) in terms of Open image in new window and Open image in new window where \(k\,=\,1, 2, {\ldots }, {M}'({M}' - 1)/2\).

The \(Y^{k}\) solutions form a cluster of the points of intersection between the lines joining the n and \(\left( {n+1} \right) \) time steps. To determine a central point within such a unidimensional cluster, we calculate the arithmetic mean \({\bar{Y}}_{n}\) of all the \(Y^{k}\) solutions between each n and \(\left( {n+1} \right) \) time steps. Despite the selection criterion Open image in new window , in order to have at least one \(Y^{k}\) solution for an intersection, there must be at least two elements in \(H_n \); hence, we exclude any such \(\left| {H_n } \right|<\) 2.

To illustrate the concentration of crossovers, we consider the case: \(x_0\,=\,0.383\), iterated for \(N\,=\,50\) with \(\mu \,=\,0.715\) and the iterates were perturbed by AWGN with a noise level of \(\hbox {SNR}\,=\,20 \, \hbox {dB}\), and \(M\,=\,200\) samples of \(\upeta ^{m}\) trajectories were collected. We show the distribution of \(Y^{k}\) through histograms for \(n\,=\,16\) and \(n\,=\,20\), respectively, in Fig. 6a, b, with calculated mean \({\bar{Y}}_{n}\) and standard deviation \(D_n\).
Fig. 7

Skew tent map with a \(\nu \,=\,0.3\) and b \(\nu \,=\,0.7\) showing the nonzero fixed point \(x_{f}\)

Fig. 8

Crossovers in the time series of \({{\mathcal {S}}}\left( {x_n }\right) \) with \(x_0 \,=\,0.8633\) for \(\nu \,=\,0.3\) and \(\hbox {SNR}\,=\,20\,\hbox {dB}\)

For our chosen case of \(\mu \,=\,0.715\), the corresponding \(x_{f}\,=\,2{\mu }/(1\,+\,2{\mu })\,=\,0.5884770\). It has been noticed that all the \({\bar{Y}}_{n}\) values are the close approximations of the said \(x_{f}\). Hence, we can determine a single point \({\upxi }\) by calculating the arithmetic mean of the collection of \({\bar{Y}}_{n}\) values, to derive the closest estimate of \(x_{f}\). Using \({\upxi }\), we therefore estimate the control parameter of the tent map. The estimated parameter \({\mu }'\) is given by rewriting (2) in terms of \({\upxi }\) and \({\mu }'\)
$$\begin{aligned} {\mu }'=\upxi /2(1-\upxi ) \end{aligned}$$
For the above-mentioned case, we determined the \({\upxi }\,=\,0.5888251\) and standard deviation \({\hbox {SD}}\,=\,0.0086253\) for the collection of \({\bar{Y}}_{n}\) values, and we find the estimated \({\mu }'\,=\,0.7160277\) which is significantly close to the actual \({\mu }\,=\,0.715\).

Next, we explore the effectiveness of the technique further by applying it to the asymmetric (skew) tent map, zigzag map and Bernoulli shift map which are more practical and widely implemented cases of 1D PWL maps.

5.1 Skew tent map

Skew tent map \({{\mathcal {S}}}\left( {x_n } \right) \) can be defined [4] as
$$\begin{aligned} x_{n+1} ={{\mathcal {S}}}\left( {x_n } \right) =\left\{ {{\begin{array}{ll} \dfrac{x_n }{\nu } &{}\quad x_n \le \nu \\ \dfrac{(1-x_n )}{\left( {1-\nu } \right) } &{}\quad \nu <x_n \\ \end{array} }} \right. \end{aligned}$$
where \(\nu \,\in \, (0,1)\) defines the map partition that controls the position of the peak—and thereby the slope on either side of the partition—causing the map to appear as skewed or asymmetric when \(\nu \, \ne \, 0.5\) as given in Fig. 7.

In Fig. 8, we show the crossovers for the first 20 iterations within the noisy time series (having SNR = 20 dB) of the skew tent map for parameter \(\nu \,=\,0.3\) and arbitrarily chosen initial condition \(x_0 \,=\,0.8633\). The parameter estimation method was applied on \(M\,=\,50\) samples of \(N\,=\,50\) iterations. As an illustration, in Fig. 9 we show the concentration of \(Y^{k}\) solutions (crossovers) between iterations 17 and 18 in a scatterplot matrix, where the histogram for the set of \(Y^{k}\) solutions can be seen. The concentration appeared in the close neighbourhood of the actual fixed point \(x_{f} \,=\,0.5882353\) (for \(\nu \,=\,0.3)\) as ensured by the average \({\bar{Y}}_{17}\,=\,0.5779640\) having standard deviation \(D_{17}\,=\,0.1368260\).

The map fixed point was estimated as \({\upxi }\,= 0.5878647\) from the average of all \({\bar{Y}}_{n}\) points for all n. For skew tent map, the relationship between the nonzero fixed point and the map parameter is given by \(x_{f} =\frac{(1-x_{f} )}{\left( {1-\nu } \right) }\), in which the \(x_{f} \) was substituted by estimated fixed point \({\upxi }\) and solved to determine the map parameter as \(\nu '\,=\,\frac{2{\upxi }-1}{{\upxi }}\,=\,0.2989283\). It can be noticed that the estimated parameter value is in close agreement with the chosen parameter value \(\nu \,=\,0.3\) for the experiment, with error approximately 0.1%. Hence, it ensures that the proposed technique can be successfully adapted for the skew tent map.
Fig. 9

Concentration of \(Y^{k}\) solutions around \(x_{f} \) shown through scatterplot histograms, between iterations 17 and 18, with higher concentration of \(Y^{k}\) solutions at \({\bar{Y}}_{17} \,=\,0.5779640\) with \(D_{17}\,=\,0.1368260\)

5.2 Zigzag map

The zigzag map \({{\mathcal {Z}}}\left( {x_n } \right) \) is defined [5] as
$$\begin{aligned}&x_{n+1} ={{\mathcal {Z}}}\left( {x_n } \right) \nonumber \\&\quad =\left\{ {{\begin{array}{ll} -\,\omega \left( {x_n +\frac{2}{\left| \omega \right| }} \right) &{}\quad -1\le x_n \le -\frac{1}{\left| \omega \right| } \\ \omega x_n &{}\quad -\frac{1}{\left| \omega \right| }<x_n \le \frac{1}{\left| \omega \right| } \\ -\,\omega \left( {x_n -\frac{2}{\left| \omega \right| }} \right) &{}\quad \frac{1}{\left| \omega \right| }<x_n \le 1 \\ \end{array}}} \right. \end{aligned}$$
where \(\omega \) is the parameter of the map ranging from \(\omega \,\in \, [-3,3]\), and the dynamical state space of \(x_n \) being \([-1,1]\).
Fig. 10

Zigzag map with a \(\omega \,=\,2.5\) showing the fixed points \(x_{fN} \), \(x_{fZ} \), \(x_{fP} \) and b \(\omega \,=\,- 2.5\) with only \(x_{fZ} \)

Fig. 11

The crossovers appearing in the noisy (SNR = 20 dB) time series of \({{\mathcal {Z}}}\left( {x_n } \right) \) around the fixed points in case of a \(\omega \,=\,2.5\) at \(x_{fP} \) and \(x_{fN} \) at \(\pm \, 0.5714285\), respectively, and for b \(\omega \,=\,- 2.5\) at \(x_{fZ} \,=\,0\)

In the zigzag map, the map parameter \(\omega \) can vary within the range of positive and negative values. In case of a positive parameter, along with the fixed point \(x_{fZ} \,=\,0\), the map has a pair of nonzero fixed points: \(x_{fN} \,=\,-\frac{2}{\left( {1+\omega } \right) }\) for the negative domain and \(x_{fP}\,=\,\frac{2}{\left( {1+\omega } \right) }\) for the positive domain as shown in Fig. 10a. When \(\omega \) is negative, the map intersects the diagonal only at \(x_{fZ}\) (shown in Fig. 10b). As a result, for \(+\,\omega \), the crossovers between the iterates appear at both negative \([-1,0)\) and positive [0, 1] ranges of the map (Fig. 11a), while that in case of \(-\,\omega \) appear only around zero, as can be seen in Fig. 11b. Such crossovers around zero, however, are rendered ineffective for our purpose because, when the parameter is changed, the resulting function simply readjusts the slope of the map about zero, and hence, no change in parameter values is reflected by the position of \(x_{fZ}\).

This problem can be resolved by addressing the fact that the negative parameter reverses the sign in every odd count of the map iteration [5]. As a result, \(-\,\omega \) causes \(\mp x_{n+1} ={{\mathcal {Z}}}( {\pm \, x_n } )\) and \(\mp x_{n+3} ={\mathcal {Z}}( {{{\mathcal {Z}}}({{{\mathcal {Z}}}( {\pm \, x_n })})})\) for odd counts, while generating \(\pm \, x_{n+2} ={{\mathcal {Z}}}\left( {{{\mathcal {Z}}}\left( {\pm \, x_n } \right) } \right) \) for the even count. Therefore, the trajectory generated with \(-\,\omega \) can be transformed into its positive equivalent by force-reversing the signs of the odd count of iterates. This can be verified through Fig. 12, where the time series of an arbitrary initial condition iterated with \(\omega \,=\,-2\) has been shown; every alternating iterate was multiplied by \(-1\) for the forced-reversal, effectively converting the recorded time series to be congruent to the dynamics by \({{\mathcal {Z}}}\left( {x_{n} } \right) \) for \(\omega \,=\,2\). As a result, in case of noisy dynamics, the meaningful crossovers around \(x_{{fP}}\) and \(x_{fN} \) can re-emerge when the signs of the alternate iterate in the time series generated by negative parameter is reversed. Since, whether the actual parameter is positive or negative will not be known—to be able to suitably adapt the proposed parameter estimation approach for the zigzag map—we record the original samples of the noisy dynamics and also produce an alternately inverted copy of the recorded data. In either of the two datasets, the desired crossovers will emerge about the nonzero fixed points depending on the sign of the parameter. If the nonzero crossover solutions are found in the inverted data set, then it can be assured that the parameter was negative, and the magnitude of \(\omega \) can be determined.

The simultaneous presence of \(x_{{fP}} \) and \(x_{fN} \) may instigate further modifications to enhance the performance of the proposed method. From the map definition in Eq. (9), it is seen that \(\left| {x_{{fP}} } \right| =\left| {x_{fN} } \right| \) (Fig. 10a) which results into symmetrically mirrored crossovers around \(x_{{fP}} \) and \(x_{fN} \) in the noisy dynamics. Therefore, the negative \(Y^{k}\) solutions generated around \(x_{fN} \) can be inverted and remapped to the positive half in order to reinforce the concentration of \(Y^{k}\) solutions on the positive side.
Fig. 12

Inverting the sign of the alternate iterates of the original trajectory generated with \(\omega \,=\,-2\) produces the same trajectory as generated by \(\omega \,=\,2\)

Fig. 13

Crossover points of the \({{\mathcal {Z}}}\left( {x_n } \right) \) between iterations 15 and 16 with the histogram showing the \(Y^{k}\) count around the fixed point \(\left| {x_{fN} } \right| \)

As an example, we apply the parameter estimation technique on the noisy time series \((\hbox {SNR}\,=\,20\,\hbox {dB})\) generated with initial condition \(x_0 \,=\,-1\) and parameter \(\omega \,=\,2.5\), for \(N\,=\,50\) and sampled for \(M\,=\,50\); the initial 20 iterations are shown in Fig. 11a. In Fig. 13, we show the concentration of \(Y^{k}\) solutions (crossovers) between iterations 15 and 16, The concentration appeared in the neighbourhood of the actual fixed point \(x_{{fP}}\,=\,0.5714285\), as determined by the average \({\bar{Y}}_{15}\,=\,0.5677584\) with standard deviation \(D_{15}\,=\,0.1830033\).

Since the \(Y^{k}\) solutions are generated on both positive and negative domain, the negative solutions are inverted before calculating the respective \({\bar{Y}}_{n}\) average. Once the \({\bar{Y}}_{n}\) points for all n have been computed, the positive fixed point of the map was estimated as \({\upxi }\,=\,0.5694459\). Replacing \(x_{fP}\) with \({\upxi }\) in \(x_{fP} \,=\,\frac{2}{\left( {1+\omega } \right) }\), the parameter is estimated to be \(\omega '\,=\,\frac{2-\xi }{\xi }\,=\,2.5121858\), which is in close agreement with the chosen \(\omega \,=\,2.5\) with \(-1.2\)% estimation error.

When the parameter is negative, the nonzero \(Y^{k}\) solutions are found in the force-reversed dataset. For a case chosen with \(\omega \,=\,-2.5\), the fixed point was estimated from the alternately reversed dataset as \({\upxi }\,=\,0.5684757\). As a result, the sign of the parameter that has been determined must be reversed back, and therefore, the estimated parameter is given by \(\omega '\,=\,-\frac{2-\xi }{\xi }\,=\,-\,2.5181797\).

5.3 Bernoulli shift map

The Bernoulli shift map \({{\mathcal {B}}}\left( {x_n } \right) \) is defined [6] by (10).
$$\begin{aligned} x_{n+1} ={{\mathcal {B}}}\left( {x_n } \right) =\left\{ {{\begin{array}{ll} 2\beta x_n +0.5 &{}\quad x_n \le 0 \\ 2\beta x_n -0.5 &{}\quad x_n >0 \\ \end{array} }} \right. \end{aligned}$$
where \(\beta \) is the parameter of the map, which has a chaotic range of \(\beta \,\in \,[0.7,1]\) while \(x_n \,\in \, [-\,0.5,0.5]\).
Fig. 14

Bernoulli map with a \(\beta \) = 1 and b intersection with diagonal appearing for \(-{{\mathcal {B}}}\left( {x_n } \right) \) with \(\beta \,=\,1\)

Fig. 15

Noisy trajectory of \({{\mathcal {B}}}\left( {x_n } \right) \) for \(\mathrm{SNR}\,=\,20\,\hbox {dB}\) with \(x_0\,=\,-\,0.23684\) and \(\beta \,=\,0.85\)

In case of Bernoulli shift map, it does not intersect the diagonal anywhere except at 0 and 1; therefore, the desired cluster of crossovers within the noisy trajectories do not appear in the neighbourhood of any dynamical fixed point, as given by the map definition which can also be verified from Fig. 14a. However, inverting the sign of the alternate iterates results in the map behaving as \(-{{\mathcal {B}}}\left( {x_n } \right) \), where it intersects the diagonal at the points \(x_{fP} =\,\frac{0.5}{1+2\beta }\) and \(x_{fN} =\,\frac{-0.5}{1+2\beta }\), shown in Fig. 14b.

As a result, prominent crossovers appear at \(x_{{fP}}\) and \(x_{{fN}}\) in the noisy samples when odd iterates are inverted, which can be treated in a similar fashion as the zigzag map.

To demonstrate, \(M\,=\,50\) samples of noisy \((\hbox {SNR}\,=\,20\,\hbox {dB})\) time series for the Bernoulli map is generated with initial condition \(x_0 \,=\,-\,0.23684\) and parameter \(\beta \,=\,0.85\), for \(N\,=\,50\) iterates, and the initial 20 iterations (after inverting the odd iterates) are shown in Fig. 15. The \(\pm \, Y^{k}\) solutions are found, from which the \(-Y^{k}\) solutions are inverted to reinforce the \(+Y^{k}\) values. The concentration of \(Y^{k}\) between iterations 12 and 13 is shown in Fig. 16 and the average \({\bar{Y}}_{12}\,=\,0.1652176\) with standard deviation \(D_{12} \,=\,0.0865524\). The estimated fixed point \({\upxi }\,=\,0.1844331\), determined from the reversed dataset, is then used to evaluate the parameter \(\beta '\,=\,-\frac{0.5-{\upxi }}{2\xi }\,=\,- 0.8555043\), where the sign must be inverted back (to 0.8555043) to suit the original map.
Fig. 16

Crossover solutions in the noisy trajectory of \({{\mathcal {B}}}\left( {x_n } \right) \) between iterations 12 and 13 with the histogram showing the concentration of \(Y^{k}\) solutions around the fixed point

Fig. 17

The proposed estimation method is attempted for 25 independent trials for each case of noise within the range of SNR = [15, 30] dB for a tent map, b skew tent map, c zigzag map and d Bernoulli shift map, with an arbitrarily chosen parameters for each map \(\mu \,=\,0.85\), \(\nu \,=\,0.25\), \(\omega \,=\,3\), and \(\beta =0.9\), respectively. It shows the mean value of the estimated \({\mu }'\) for all 25 attempts with 95% confidence intervals for each SNR condition

5.4 Confidence interval

In many cases, the harsher conditions of dynamical noise can cause the system to depart from normal distribution [10], as it may introduce some systematic error in the statistical estimates. Therefore, to further ensure the efficacy of the approach, the estimation experiment has been repeated for the individual maps over a range of SNR values in order to determine the error bar for each case of SNR. For each case of the maps, we notice that the estimated parameter values at SNR values 10 dB or less, are quite apart from the chosen test parameters. However, better results are achieved for slightly improved SNR values as relatively lower noise may still preserve the qualitative properties of the trajectories [31]. We show in Fig. 17a–d the error bar estimates for tent map \((\mu \,=\,0.85)\), skew tent \((\nu \,=\,0.25)\), zigzag \((\omega \,=\,3)\) and Bernoulli maps \((\beta =0.9)\), respectively, with the corresponding mean of parameter estimates.

Let us say for tent map, \(\mu _{\mathrm{mean}}^{\prime } =\frac{1}{Q}\mathop \sum \nolimits _{q=1}^Q \mu _q^{\prime } \) of \(Q\,=\,25\) independent estimation attempts; \(\mu _q^{\prime } \) for \(q=1,\,2,\ldots ,\,Q\) is computed for each case of noise over a range of SNR values 15–30 dB. To estimate the standard error bar, we calculate the upper and lower bound with 95% confidence interval given by \(\mu _{\mathrm{mean}}^{\prime } \pm \, 1.96\left( {\frac{\mu _{\mathrm{SD}}^{\prime } }{\sqrt{Q}}} \right) \), respectively, where \(\mu _{\mathrm{SD}}^{\prime } \) is the standard deviation of Q estimation attempts. Similarly, we determine the standard error bars \(\nu _{\mathrm{mean}}^{\prime } \pm \, 1.96\left( {\frac{\nu _{\mathrm{SD}}^{\prime } }{\sqrt{Q}}} \right) \), \(\omega _{\mathrm{mean}}^{\prime } \pm \, 1.96\left( {\frac{\omega _{\mathrm{SD}}^{\prime } }{\sqrt{Q}}} \right) \) and \(\beta _{\mathrm{mean}}^{\prime } \pm \, 1.96\left( {\frac{\beta _{\mathrm{SD}}^{\prime } }{\sqrt{Q}}} \right) \) for the skew tent, zigzag and Bernoulli shift maps, respectively. It can be seen that the estimated outcomes in the chosen cases of the maps start to improve from SNR 15 dB onwards.

6 Conclusion

In this paper, we proposed a method to estimate the control parameter of the 1D PWL maps from noisy dynamics of the system. Due to the inherent noise in physically implemented chaotic systems the dynamical behaviour of the function becomes greatly affected. Even a small amount of noise distorts the map trajectories to a great extent. For the effective retrieval of the meaningful trajectories, existing noise reduction techniques require additional information about either the dynamical system definition or the noise level within the system. Given the computational complexity that it might add while approximating the system model or determining the noise level, we chose to estimate the control parameter of the system, whose value fully defines the behaviour of the map.

We have shown that the iterates of the dynamical time series can be treated as points on a two-dimensional Cartesian coordinate system. As the trajectories become highly distributed over the state space due to the presence of dynamical noise in the system, we show that the straight lines connecting the (XY) coordinates of the consecutive iterates of all the sampled time series form a cluster of intersections between the nth and \((n+1)\)th iterates. We have shown that such clusters appear in the close neighbourhood of the unstable nonzero fixed point of the maps (tent map, skew tent map, zigzag map and Bernoulli shift map) considered. We have established the fact that the straight lines connecting the points (for tent map originating from [0.5, 1]) with their consecutive iterates will always intersect each other at the nonzero fixed point. Utilising this property, we have shown how the value of the fixed point can be estimated from the clusters and the parameter of the 1D PWL maps can be determined.

The effectiveness of the proposed method has been studied through numerical simulations where the estimations have been tried with various cases of parameters and noise levels for each case of 1D PWL maps. We have conducted a statistical analysis for the behaviour of the algorithm by showing the consistency of the estimated outcomes through numerous attempts, for a range of SNR values for each map described. We have shown for a range of SNR values (e.g. 15–30), the parameter estimates are satisfactorily close and that can further improve the system approximations through the mentioned noise reduction techniques.



The authors are thankful to the anonymous reviewers for their constructive feedback and criticism towards improvising the quality of this work.

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.


  1. 1.
    Banerjee, S., Yorke, J.A., Grebogi, C.: Robust chaos. Phys. Rev. Lett. 80(14), 3049–3052 (1998). CrossRefzbMATHGoogle Scholar
  2. 2.
    de la Fraga, L.G., Torres-Pérez, E., Tlelo-Cuautle, E., Mancillas-López, C.: Hardware implementation of pseudo-random number generators based on chaotic maps. Nonlinear Dyn. 90(3), 1661–1670 (2017). CrossRefGoogle Scholar
  3. 3.
    Basu, R., Dutta, D., Banerjee, S., Holmes, V., Mather, P.: An algorithmic approach for signal measurement using symbolic dynamics of tent map. IEEE Trans. Circuits Syst. I Regul. Pap. (2017). MathSciNetCrossRefGoogle Scholar
  4. 4.
    Palacios-Luengas, L., Delgado-Gutiérrez, G., Díaz-Méndez, J.A., Vázquez-Medina, R.: Symmetric cryptosystem based on skew tent map. Multimed. Tools Appl. 77(2), 2739–2770 (2018). CrossRefGoogle Scholar
  5. 5.
    Nejati, H., Beirami, A., Ali, W.H.: Discrete-time chaotic-map truly random number generators: design, implementation, and variability analysis of the zigzag map. Analog Integr. Circuits Signal Process. 73(1), 363–374 (2012). CrossRefGoogle Scholar
  6. 6.
    Zhang, Z., Wang, H., Zhao, Y., Liu, J., Yang, L.: Frequency modulated radar signal with combined chaotic sequence based on Bernoulli map. J. Commun. Technol. Electron. 61(8), 971–979 (2016). CrossRefGoogle Scholar
  7. 7.
    Liu, L., Hu, J., Li, H., Li, J., He, Z., Han, C.: Parameter estimation of a class one-dimensional discrete chaotic system. Discrete Dyn. Nat. Soc. (2011). Google Scholar
  8. 8.
    Li, C.: A new method of determining chaos-parameter-region for the tent map. Chaos Solitons Fractals 21(4), 863–867 (2004). MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Wu, X., Hu, H., Zhang, B.: Parameter estimation only from the symbolic sequences generated by chaos system. Chaos Solitons Fractals 22(2), 359–366 (2004). CrossRefzbMATHGoogle Scholar
  10. 10.
    Strumik, M., Macek, W.M.: Influence of dynamical noise on time series generated by nonlinear maps. Phys. D Nonlinear Phenom. 237(5), 613–618 (2008). MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Orzeszko, W.: The new method of measuring the effects of noise reduction in chaotic data. Chaos Solitons Fractals 38(5), 1355–1368 (2008). CrossRefGoogle Scholar
  12. 12.
    Kantz, H., Schreiber, T.: Nonlinear Time Series Analysis, 2nd edn. Cambridge University Press, Cambridge (2003)CrossRefGoogle Scholar
  13. 13.
    Schreiber, T.: Determination of the noise level of chaotic time series. Phys. Rev. E 48(1), R13–R16 (1993). CrossRefGoogle Scholar
  14. 14.
    Davies, M.: Noise reduction schemes for chaotic time series. Phys. D Nonlinear Phenom. 79(2), 174–192 (1994). MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Grassberger, P., Hegger, R., Kantz, H., Schaffrath, C., Schreiber, T.: On noise reduction methods for chaotic data. Chaos Interdiscip. J. Nonlinear Sci. 3(2), 127–141 (1993). MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Schreiber, T., Kantz, H.: Noise in chaotic data: diagnosis and treatment. Chaos Interdiscip. J. Nonlinear Sci. 5(1), 133–142 (1995). CrossRefGoogle Scholar
  17. 17.
    Serletis, D.: Effect of noise on fractal structure. Chaos Solitons Fractals 38(4), 921–924 (2008). CrossRefGoogle Scholar
  18. 18.
    Agarwal, R., Agarwal, V.: Dynamic noise perturbed generalized superior Mandelbrot sets. Nonlinear Dyn. 67(3), 1883–1891 (2012). MathSciNetCrossRefGoogle Scholar
  19. 19.
    Abarbanel, H.D.I., SpringerLink (Online service). Analysis of Observed Chaotic Data, 1st edn. Springer, New York (1996). CrossRefGoogle Scholar
  20. 20.
    Badii, R., Broggi, G., Derighetti, B., Ravani, M., Ciliberto, S., Politi, A., Rubio, M.A.: Dimension increase in filtered chaotic signals. Phys. Rev. Lett. 60(11), 979–982 (1988). CrossRefGoogle Scholar
  21. 21.
    Kostelich, E.J.: The analysis of chaotic time-series data. Syst. Control Lett. 31(5), 313–319 (1997). MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Kostelich, E.J., Schreiber, T.: Noise reduction in chaotic time-series data: a survey of common methods. Phys. Rev. E 48(3), 1752–1763 (1993). MathSciNetCrossRefGoogle Scholar
  23. 23.
    Kostelich, E.J., Yorke, J.A.: Noise reduction: finding the simplest dynamical system consistent with the data. Phys. D Nonlinear Phenom. 41(2), 183–196 (1990). MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Casdagli, M.: Nonlinear prediction of chaotic time series. Phys. D Nonlinear Phenom. 35(3), 335–356 (1989). MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Han, M., Liu, Y., Xi, J., Guo, W.: Noise smoothing for nonlinear time series using wavelet soft threshold. IEEE Signal Process. Lett. 14(1), 62–65 (2007). CrossRefGoogle Scholar
  26. 26.
    Han, X., Chang, X.: An intelligent noise reduction method for chaotic signals based on genetic algorithms and lifting wavelet transforms. Inf. Sci. 218, 103–118 (2013). CrossRefGoogle Scholar
  27. 27.
    Marteau, P.F., Abarbanel, H.D.I.: Noise reduction in chaotic time series using scaled probabilistic methods. J. Nonlinear Sci. 1(3), 313–343 (1991). MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Schweizer, J., Schimming, T.: Symbolic dynamics for processing chaotic signals. I. Noise reduction of chaotic sequences. IEEE Trans. Circuits Syst I Fundam. Theory Appl. 48(11), 1269–1282 (2001). MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Soriano, D.C., Suyama, R., Attux, R.: Blind extraction of chaotic sources from mixtures with stochastic signals based on recurrence quantification analysis. Digit. Signal Process. 21(3), 417–426 (2011). CrossRefGoogle Scholar
  30. 30.
    Collet, P., Eckmann, J.: Modern Birkhäuser Classics: Iterated Maps on the Interval as Dynamical Systems. Birkhäuser, Boston (2009)CrossRefGoogle Scholar
  31. 31.
    Ott, E., Yorke, E.D., Yorke, J.A.: A scaling law: how an attractor’s volume depends on noise level. Phys. D Nonlinear Phenom. 16(1), 62–78 (1985). MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© The Author(s) 2018

Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Authors and Affiliations

  1. 1.Engineering and Technology Department, School of Computing and EngineeringUniversity of HuddersfieldHuddersfieldUK
  2. 2.Department of Physical SciencesIndian Institute of Science Education and Research, Kolkata NadiaIndia

Personalised recommendations