Stopping set analysis of 3-dimensional turbo code ensembles - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Stopping set analysis of 3-dimensional turbo code ensembles

Abstract

In this paper, we analyze the asymptotic stopping set distribution of 3-dimensional turbo code (3D-TC) ensembles, consisting of a parallel turbo code concatenated in series with an inner accumulator which encodes only a fraction λ of the turbo code parity bits. We show that, for certain parameters, the stopping distance of 3D-TC ensembles asymptotically grows linearly with the block length, i.e., 3D-TCs are good for the binary erasure channel. We also consider random puncturing of non-systematic bits and show that higher (or some) linear growth rate is obtained for decreasing values of λ, contrary to the asymptotic minimum distance, whose growth rate decreases with decreasing values of λ. Finally, iterative convergence thresholds of 3D-TC ensembles are analyzed by means of extrinsic information transfer charts.
No file

Dates and versions

hal-01170827 , version 1 (02-07-2015)

Identifiers

Cite

Alexandre Graell I Amat, Eirik Rosnes. Stopping set analysis of 3-dimensional turbo code ensembles. ISIT 2010 : IEEE International Symposium on Information Theory, Jun 2010, Austin, United States. pp.2013 - 2017, ⟨10.1109/ISIT.2010.5513362⟩. ⟨hal-01170827⟩
56 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More