Improving Turbo Codes for 5G with parity puncture-constrained interleavers

Abstract

A new method to design punctured Turbo Codes (TCs) with improved performance in both the waterfall and error floor regions is introduced. First, the puncturing pattern is selected by analyzing the constituent code distance spectrum and the TC extrinsic information exchange using uniform interleavers. Then, the interleaver function is defined via a graph-based approach including different design criteria such as minimum span, correlation girth, and puncturing constraints during the design process. An application example is elaborated and compared with the Long Term Evolution (LTE) standard: a significant gain in error rate performance can be observed. An additional benefit of the proposed technique is a significant reduction of the search space for the different interleaver parameters.

Low Complexity Non-binary Turbo Decoding based on the Local-SOVA Algorithm

“…To construct the finite field, we used the following primitive polynomial: P GF(64) (D) = 1 + D 2 + D 3 + D 5 + D 6 . The Turbo code interleaver uses an Almost Regular Permutation (ARP) designed for the frame size of K s = 160 GF(64) symbols (960 bits) following [17]- [19]. To assess the proposed NN-LSOVA algorithm, several low-complexity configurations were evaluated (see Table II).…”

Mitigating Blind Detection Through Protograph Based Interleaving for Turbo Codes

“…It was shown in [21] that the ARP interleaver can provide the same interleaving properties as QPP and DRP interleavers with the same or higher minimum Hamming distance values. Furthermore, a protograph-based construction method for parity puncture constrained ARP interleavers [22] was presented in [17], allowing the construction of interleavers with low error floors in the presence of puncturing. We briefly recall this method here in order to provide necessary background.…”

Fully Pipelined Iteration Unrolled Decoders the Road to TB/S Turbo Decoding

“…Figure 4 shows BER simulation results for frame sizes of K = 128, 256, and 512 bits for a X-window size of 32. The respective Almost Regular Permutation (ARP) interleaver parameters were obtained through the methods described in [29], [30] and are listed in Tables I and II 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] Punct. Pattern P 1 [0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0] Punct.…”