Performance analysis of correlation-based communication schemes utilizing chaos

Using chaotic signals in spread-spectrum communications has a few clear advantages over traditional approaches. Chaotic signals are nonperiodic, wideband, and more difficult to predict, reconstruct, and characterize than periodic carriers. These properties of chaotic signals make it more difficult to intercept and decode the information modulated upon them. However, many suggested chaos-based communication schemes do not provide processing gain, a feature highly desirable in spread-spectrum communication schemes. In this paper, we suggest two communication schemes that provide a processing gain. The performance of these and of the earlier proposed differential chaos shift keying is studied analytically and numerically for discrete time implementations. It is shown that, when performance is characterized by the dependence of bit error rate on E_b/N₀, the increase of the spreading sequence length beyond a certain point degrades the performance. For a given E_b/N₀, there is a length of the spreading sequence that minimizes the bit error rate