Performance of Parallel Concatenated Coding Schemes

In this paper we study ensembles of parallel concatenated codes and we present precise results on their asymptotic performance. In particular, we prove that We prove that in any parallel concatenation scheme where all k encoders are recursive and the rate is sufficiently small, the bit error rate goes to 0 exactly as N1-k . We consider different types of ensembles by changing the subgroup of permutations used to interconnect the various encoders.

• Type: Journal
• Year: 2008
• Where: TIT
• Authors: Fabio Fagnani
• Keywords: Bit Error Rate, Parallel Concatenated Codes, Parallel Concatenation Scheme, TIT 2008