Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?
<|reference_start|>Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?: In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error floor than that of its rate-1/3 parent code, if a particular condition is met. However, assuming iterative decoding, convergence of the non-systematic code towards low bit-error rates is problematic. To alleviate this problem, we propose rate-1/2 partially-systematic codes that can still achieve a lower error floor than that of their rate-1/3 parent codes. Results obtained from extrinsic information transfer charts and simulations support our conclusion.<|reference_end|>
@article{chatzigeorgiou2007can,
    title={Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than
  their Rate-1/3 Parent Codes?},
    author={I. Chatzigeorgiou, M. R. D. Rodrigues, I. J. Wassell, R. Carrasco},
    journal={arXiv preprint arXiv:cs/0701065},
    year={2007},
    doi={10.1109/ITW2.2006.323763},
    archivePrefix={arXiv},
    eprint={cs/0701065},
    primaryClass={cs.IT math.IT}
}