Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?

A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes

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…

Spatially coupled turbo-like codes: a new trade-off between waterfall and error floor

Spatially coupled turbo-like codes (SC-TCs) have been shown to have excellent decoding thresholds due to the threshold saturation effect. Furthermore, even for moderate block lengths, simulation results demonstrate very good bit error rate performance (BER) in the waterfall region. In this paper, we discuss the effect of spatial coupling on the performance of TCs in the finite block-length regime. We investigate the effect of coupling on the error-floor performance of SC-TCs by establishing conditions under which spatial coupling either preserves or improves the minimum distance of TCs. This a…

删余卷积码与Turbo码的译码：一种满足协议合规性的深度学习解决方案

Decoding for Punctured Convolutional and Turbo Codes: A Deep Learning Solution for Protocols Compliance

针对现有神经译码方法难以适配删余码可变码率、不满足协议兼容性的问题，本文提出带删余感知嵌入和平衡误码率训练的LSTM统一译码器，经仿真验证在两类信道下译码精度和鲁棒性均优于传统方法。

Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes

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 …

Irregular turbo code design for the binary erasure channel

In this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This exact expression will be used to track the density evolution of turbo codes over the erasure channel, that will allow for the design of capacity-approaching irregular turbo codes. Next, we propose a graph-optimal interleaver for irregular turbo codes. Simulation results for different coding rates is shown at the end.

The Error-Pattern-Correcting Turbo Equalizer

The error-pattern correcting code (EPCC) is incorporated in the design of a turbo equalizer (TE) with aim to correct dominant error events of the inter-symbol interference (ISI) channel at the output of its matching Viterbi detector. By targeting the low Hamming-weight interleaved errors of the outer convolutional code, which are responsible for low Euclidean-weight errors in the Viterbi trellis, the turbo equalizer with an error-pattern correcting code (TE-EPCC) exhibits a much lower bit-error rate (BER) floor compared to the conventional non-precoded TE, especially for high rate applications…