Computer Science – Information Theory
Scientific paper
2007-04-03
Computer Science
Information Theory
5 pages, 1 figure, Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France, June 24-29, 2007
Scientific paper
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.
Carrasco Rolando
Chatzigeorgiou Ioannis
Rodrigues Miguel R. D.
Wassell Ian J.
No associations
LandOfFree
Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-255945