Home > Research > Publications & Outputs > Pseudo-random puncturing

Research

Links

Text available via DOI:

Keywords

View graph of relations

Pseudo-random puncturing: a technique to lower the error floor of turbo codes

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

Published

Standard

Pseudo-random puncturing: a technique to lower the error floor of turbo codes. / Chatzigeorgiou, Ioannis; Rodrigues, Miguel R. D.; Wassell, Ian J. et al.
Information Theory, 2007. ISIT 2007. IEEE International Symposium on. New York: IEEE, 2007. p. 656-660.

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

Harvard

Chatzigeorgiou, I, Rodrigues, MRD, Wassell, IJ & Carrasco, R 2007, Pseudo-random puncturing: a technique to lower the error floor of turbo codes. in Information Theory, 2007. ISIT 2007. IEEE International Symposium on. IEEE, New York, pp. 656-660. https://doi.org/10.1109/ISIT.2007.4557299

APA

Chatzigeorgiou, I., Rodrigues, M. R. D., Wassell, I. J., & Carrasco, R. (2007). Pseudo-random puncturing: a technique to lower the error floor of turbo codes. In Information Theory, 2007. ISIT 2007. IEEE International Symposium on (pp. 656-660). IEEE. https://doi.org/10.1109/ISIT.2007.4557299

Vancouver

Chatzigeorgiou I, Rodrigues MRD, Wassell IJ, Carrasco R. Pseudo-random puncturing: a technique to lower the error floor of turbo codes. In Information Theory, 2007. ISIT 2007. IEEE International Symposium on. New York: IEEE. 2007. p. 656-660 doi: 10.1109/ISIT.2007.4557299

Author

Chatzigeorgiou, Ioannis ; Rodrigues, Miguel R. D. ; Wassell, Ian J. et al. / Pseudo-random puncturing : a technique to lower the error floor of turbo codes. Information Theory, 2007. ISIT 2007. IEEE International Symposium on. New York : IEEE, 2007. pp. 656-660

Bibtex

@inproceedings{fe87c334ea2b4bb18d32017ea4cb1fc2,
title = "Pseudo-random puncturing: a technique to lower the error floor of turbo codes",
abstract = "It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search, whilst convergence towards low bit error probabilities can be problematic when the systematic output of a rate-1/2 partially systematic PCCC is heavily punctured. In this paper, we present and study a family of rate-1/2 partially systematic PCCCs, which we call pseudo-randomly punctured codes. We evaluate their bit error rate performance and we show that they always yield a lower error floor than that of their rate-1/3 parent codes. Furthermore, we compare analytic results to simulations and we demonstrate that their performance converges towards the error floor region, owning to the moderate puncturing of their systematic output. Consequently, we propose pseudo-random puncturing as a means of improving the bandwidth efficiency of a PCCC and simultaneously lowering its error floor.",
keywords = "CONVOLUTIONAL-CODES, CHANNELS, DESIGN",
author = "Ioannis Chatzigeorgiou and Rodrigues, {Miguel R. D.} and Wassell, {Ian J.} and Rolando Carrasco",
year = "2007",
doi = "10.1109/ISIT.2007.4557299",
language = "English",
isbn = "978-1-4244-1397-3",
pages = "656--660",
booktitle = "Information Theory, 2007. ISIT 2007. IEEE International Symposium on",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Pseudo-random puncturing

T2 - a technique to lower the error floor of turbo codes

AU - Chatzigeorgiou, Ioannis

AU - Rodrigues, Miguel R. D.

AU - Wassell, Ian J.

AU - Carrasco, Rolando

PY - 2007

Y1 - 2007

N2 - It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search, whilst convergence towards low bit error probabilities can be problematic when the systematic output of a rate-1/2 partially systematic PCCC is heavily punctured. In this paper, we present and study a family of rate-1/2 partially systematic PCCCs, which we call pseudo-randomly punctured codes. We evaluate their bit error rate performance and we show that they always yield a lower error floor than that of their rate-1/3 parent codes. Furthermore, we compare analytic results to simulations and we demonstrate that their performance converges towards the error floor region, owning to the moderate puncturing of their systematic output. Consequently, we propose pseudo-random puncturing as a means of improving the bandwidth efficiency of a PCCC and simultaneously lowering its error floor.

AB - It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search, whilst convergence towards low bit error probabilities can be problematic when the systematic output of a rate-1/2 partially systematic PCCC is heavily punctured. In this paper, we present and study a family of rate-1/2 partially systematic PCCCs, which we call pseudo-randomly punctured codes. We evaluate their bit error rate performance and we show that they always yield a lower error floor than that of their rate-1/3 parent codes. Furthermore, we compare analytic results to simulations and we demonstrate that their performance converges towards the error floor region, owning to the moderate puncturing of their systematic output. Consequently, we propose pseudo-random puncturing as a means of improving the bandwidth efficiency of a PCCC and simultaneously lowering its error floor.

KW - CONVOLUTIONAL-CODES

KW - CHANNELS

KW - DESIGN

U2 - 10.1109/ISIT.2007.4557299

DO - 10.1109/ISIT.2007.4557299

M3 - Conference contribution/Paper

SN - 978-1-4244-1397-3

SP - 656

EP - 660

BT - Information Theory, 2007. ISIT 2007. IEEE International Symposium on

PB - IEEE

CY - New York

ER -