By Topic

Performance of Parallel Concatenated Coding Schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fagnani, F. ; Politec. di Torino, Turin

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 4 )