On the threshold effect in the estimation of chaotic sequences

• Authors: I. Hen;N. Merhav
• Venue: IEEE Transactions on Information Theory
• Year: 2006

Chaotic sequences and chaotic dynamical systems are attractive candidates for use in signal synthesis and analysis as well as in communications applications. In previous works, various methods for the estimation of chaotic sequences under noise were developed. However, although the methods were different, their qualitative performance was the same: for high signal-to-noise ratio (SNR) the performance was good, but below some threshold SNR, a sharp degradation in performance occurred. We prove and quantify the existence of this threshold effect and derive lower bounds on the value of the threshold SNR. Using information-theoretic tools, we prove that for any ergodic chaotic system, there is a certain threshold SNR level below which the ratio between the mean-square error obtained by any estimator of the system's initial state at the output of additive white Gaussian noise (AWGN) channel and the Cramer-Rao bound increases exponentially fast as the number of observations N grows without bound. We explain the connection between the existence of a threshold effect in the estimation of chaotic sequences and the converse to the joint source-channel coding theorem. We derive lower bounds on SNRth, the value of the threshold SNR, as a function of the system's Lyapunov exponent. Our bounds have two versions, one for a finite number of observations, and one for the asymptotic regime as N→∞. For the asymptotic regime, the bound we develop on the threshold SNR incorporates the key parameters of chaotic systems, the Lyapunov exponent, and the chaotic sequence power spectrum into a simple formula. We demonstrate our results on the chaotic system governed by the r-diadic map.