Reducing the convergence loss of 3-dimensional turbo codes

Kbaier Ben Ismail, Dhouha; Douillard, C. and Kerouedan, S. (2010). Reducing the convergence loss of 3-dimensional turbo codes. In: 2010 6th International Symposium on Turbo Codes & Iterative Information Processing, IEEE pp. 146–150.

DOI: https://doi.org/10.1109/ISTC.2010.5613823

Abstract

This paper deals with the convergence loss reduction of a 3-dimensional turbo code combining both parallel and serial concatenation. This code is derived from the classical turbo code by concatenating a rate-1 post-encoder at its output. In order to reduce the observable loss of convergence at high error rates, we propose first a time varying construction of the post-encoded parity. Then, we analyse the association of the 3-dimensional turbo code with high order modulations, where both the systematic bits and the post-encoded parity bits are more protected than the other parity bits. Performance comparisons are made between the 3GPP2 standardized turbo code and the 3-dimensional 3GPP2 turbo code. The different stages are illustrated with simulation results, asymptotical bounds and EXIT charts.

Viewing alternatives

Look up in Google Scholar

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions
No digital document available to download for this item

Item Actions

Export

About

CORE (COnnecting REpositories)

Recommendations