{'fraction_non_alphanumeric': 0.009211873080859774, 'fraction_numerical': 0.0, 'mean_word_length': 5.229299363057325, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Performance Evaluation of Parallel Concatenated Chaos Coded Modulations

In this article we study the performance of a class of parallel concatenated encoders 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 both the bit and frame error rate behavior at the error floor region. We also show that these chaos bases parallel concatenated schemes yield performances comparable to binary turbocodes and are thus of potential interest in communications.