一种快速性能评估的联合界近似
A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes
摘要：
在本文中，我们提出了一个简单的技术来近似性能的联合界的打孔Turbo码。边界近似仅利用对整体性能有重大影响的传递函数的那些项。我们重新审视的组成卷积编码器的结构，我们开发了一种快速的方法来计算最重要的条款的Turbo编码器的传递函数。我们证明，对于一个大的交织器的大小，这种近似是非常准确的。此外，我们将我们提出的方法应用到一个家庭的打孔Turbo码，我们称之为伪随机打孔码。最后，我们强调我们的方法相比，以前采用的好处。我们还强调了伪随机打孔的优势，其他打孔方案。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
