Abstract

In this paper, ensembles of parallel concatenated codes are studied and rigorous results on their asymptotic performance, under the assumption of maximum-likelihood (ML) decoding, are presented. In particular, it is proven that in any parallel concatenation scheme with k branches where all k encoders are recursive and the Bhattacharyya parameter of the channel is sufficiently small, the bit-error rate (BER) and the word-error rate go to 0 exactly like N 1- k and N 2- k, respectively. Different types of ensembles by changing the subgroup of permutations used to interconnect the various encoders, are considered.

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 call

Disclaimer: 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.