Chaotic signal detection and estimation based on attractor sets: applications to secure communications

We consider the problem of detection and estimation of chaotic signals in the presence of white Gaussian noise. Traditionally this has been a difficult problem since generalized likelihood ratio tests are difficult to implement due to the chaotic nature of the signals of interest. Based on Poincare's recurrence theorem we derive an algorithm for approximating a chaotic time series with unknown initial conditions. The algorithm approximates signals using elements carefully chosen from a dictionary constructed based on the chaotic signal's attractor. We derive a detection approach based on the signal estimation algorithm and show, with simulated data, that the new approach can outperform other methods for chaotic signal detection. Finally, we describe how the attractor based detection scheme can be used in a secure binary digital communications protocol.