We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > A union bound approximation for rapid performan...
View graph of relations

« Back

A union bound approximation for rapid performance evaluation of punctured turbo codes

Research output: Contribution in Book/Report/ProceedingsPaper


Publication date2007
Host publication41st Annual Conference on Information Sciences and Systems
Place of publicationNEW YORK
Number of pages6
ISBN (Print)978-1-4244-1036-1
Original languageEnglish


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.