Home > Research > Publications & Outputs > Can punctured rate-1/2 turbo codes achieve a lo...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.?

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.? / Chatzigeorgiou, Ioannis; Rodrigues, Miguel R. D.; Wassell, Ian J. et al.
Proceedings of 2006 IEEE Information Theory Workshop. ed. / PZ Fan; P Li; R Yeung. NEW YORK: IEEE, 2006. p. 91-95.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Chatzigeorgiou, I, Rodrigues, MRD, Wassell, IJ & Carrasco, R 2006, Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.? in PZ Fan, P Li & R Yeung (eds), Proceedings of 2006 IEEE Information Theory Workshop. IEEE, NEW YORK, pp. 91-95. https://doi.org/10.1109/ITW2.2006.323763

APA

Chatzigeorgiou, I., Rodrigues, M. R. D., Wassell, I. J., & Carrasco, R. (2006). Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.? In PZ. Fan, P. Li, & R. Yeung (Eds.), Proceedings of 2006 IEEE Information Theory Workshop (pp. 91-95). IEEE. https://doi.org/10.1109/ITW2.2006.323763

Vancouver

Chatzigeorgiou I, Rodrigues MRD, Wassell IJ, Carrasco R. Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.? In Fan PZ, Li P, Yeung R, editors, Proceedings of 2006 IEEE Information Theory Workshop. NEW YORK: IEEE. 2006. p. 91-95 doi: 10.1109/ITW2.2006.323763

Author

Chatzigeorgiou, Ioannis ; Rodrigues, Miguel R. D. ; Wassell, Ian J. et al. / Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.?. Proceedings of 2006 IEEE Information Theory Workshop. editor / PZ Fan ; P Li ; R Yeung. NEW YORK : IEEE, 2006. pp. 91-95

Bibtex

@inproceedings{ee0b3868087849a5b9c4091a36b732a4,
title = "Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.?",
abstract = "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.",
keywords = "CONVOLUTIONAL-CODES, CHANNELS, DESIGN, TURBO-CODES",
author = "Ioannis Chatzigeorgiou and Rodrigues, {Miguel R. D.} and Wassell, {Ian J.} and Rolando Carrasco",
year = "2006",
doi = "10.1109/ITW2.2006.323763",
language = "English",
isbn = "1-4244-0067-8",
pages = "91--95",
editor = "PZ Fan and P Li and R Yeung",
booktitle = "Proceedings of 2006 IEEE Information Theory Workshop",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Can punctured rate-1/2 turbo codes achieve a lower error floor than their rate-1/3 parent codes.?

AU - Chatzigeorgiou, Ioannis

AU - Rodrigues, Miguel R. D.

AU - Wassell, Ian J.

AU - Carrasco, Rolando

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - CONVOLUTIONAL-CODES

KW - CHANNELS

KW - DESIGN

KW - TURBO-CODES

U2 - 10.1109/ITW2.2006.323763

DO - 10.1109/ITW2.2006.323763

M3 - Conference contribution/Paper

SN - 1-4244-0067-8

SP - 91

EP - 95

BT - Proceedings of 2006 IEEE Information Theory Workshop

A2 - Fan, PZ

A2 - Li, P

A2 - Yeung, R

PB - IEEE

CY - NEW YORK

ER -