Computer Science – Information Theory
Scientific paper
2007-02-19
Computer Science
Information Theory
6 pages, 5 figures, 1 table, Proceedings of the 41st Conference on Information Sciences and Systems, Baltimore, USA, March 14-
Scientific paper
In this paper, we present a simple technique to approximate the performance union bound of a punctured turbo code. The bound approximation exploits only those terms of the transfer function that have a major impact on the overall performance. We revisit the structure of the constituent convolutional encoder and we develop a rapid method to calculate the most significant terms of the transfer function of a turbo encoder. We demonstrate that, for a large interleaver size, this approximation is very accurate. Furthermore, we apply our proposed method to a family of punctured turbo codes, which we call pseudo-randomly punctured codes. We conclude by emphasizing the benefits of our approach compared to those employed previously. We also highlight the advantages of pseudo-random puncturing over other puncturing schemes.
Carrasco Rolando
Chatzigeorgiou Ioannis
Rodrigues Miguel R. D.
Wassell Ian J.
No associations
LandOfFree
A Union Bound Approximation for Rapid Performance Evaluation of Punctured 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 A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-566974