Parallel concatenated chaos coded modulations

In this article we propose a parallel concatenated encoder similar to a turbo trellis coded modulation, but where the constituent encoders are chaos coded modulators. We show that, even when the uniform error property does not hold for the kind of constituent chaos coded modulations employed, it is still possible to draw a reasonable bound for the bit error probability at the error floor region based on the interleaver structure. The simulations validate the bounds and show that the dynamics of the underlying chaotic maps, rather than the quantization level of the constituent encoders, is the most important factor to account for the error rate behaviour at the error floor region.

[1]  Christian Schlegel,et al.  Trellis and turbo coding , 2004 .

[2]  S. Kozic,et al.  How to repair CSK using small perturbation control - Case study and performance analysis , 2003 .

[3]  Miguel A. F. Sanjuán,et al.  ITERATIVELLY DECODING CHAOS ENCODED BINARY SIGNALS , 2005, Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005..

[4]  Martin Hasler,et al.  Controlled One- and Multidimensional Modulations Using Chaotic Maps , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  Krishna R. Narayanan,et al.  Concatenated codes for fading channels based on recursive space-time trellis codes , 2003, IEEE Trans. Wirel. Commun..

[6]  F. Pollara,et al.  Serial concatenation of interleaved codes: performance analysis, design and iterative decoding , 1996, Proceedings of IEEE International Symposium on Information Theory.

[7]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[8]  Peter J. McLane,et al.  Uniform distance and error probability properties of TCM schemes , 1991, IEEE Trans. Commun..