Toggle Main Menu Toggle Search

Open Access padlockePrints

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

Lookup NU author(s): Emeritus Professor Rolando Carrasco

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


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. ©2007 IEEE.


Publication metadata

Author(s): Chatzigeorgiou I, Rodrigues MRD, Wassell IJ, Carrasco R

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: IEEE International Symposium on Information Theory - Proceedings

Year of Conference: 2007

Pages: 656-660

Publisher: IEEE

URL: http://dx.doi.org.10.1109/ISIT.2007.4557299

DOI: 10.1109/ISIT.2007.4557299

Library holdings: Search Newcastle University Library for this item

ISBN: 1424414296


Share