Abstract
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 andframe error rate behavior at the error floor region. We alsoshow that these chaos bases parallel concatenated schemes yield performances comparable to binary turbocodes and are thus of potential interest in communications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
