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