TY - GEN
T1 - Trapping set enumerators for repeat multiple accumulate code ensembles
AU - Koller, Christian
AU - Graell i Arnatt, Alexandre
AU - Kliewerl, Jorg
AU - Costello, Daniel J.
PY - 2009
Y1 - 2009
N2 - The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptoticallyood and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximurn likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite length ensemble trapping et enumerator for repeat multiple accumulate codes by creating a trellis representation of trapping sets. We also obtain the asym ptotic expressions when the block length tends to infinity and evaluate them numerically.
AB - The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptoticallyood and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximurn likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite length ensemble trapping et enumerator for repeat multiple accumulate codes by creating a trellis representation of trapping sets. We also obtain the asym ptotic expressions when the block length tends to infinity and evaluate them numerically.
UR - http://www.scopus.com/inward/record.url?scp=70449465536&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449465536&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205355
DO - 10.1109/ISIT.2009.5205355
M3 - Conference contribution
AN - SCOPUS:70449465536
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1819
EP - 1823
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -