Iterative decoding of Generalized Parallel Concatenated Block codes using cyclic permutations

TL;DR

This paper introduces a novel iterative decoding approach for GPCB codes using cyclic permutations, demonstrating promising performance improvements and analyzing various parameters' effects through extensive simulations.

Contribution

A new variant of the component decoder for GPCB codes with cyclic permutations, showing comparable or improved performance over existing methods.

Findings

The new decoder's BER performance is similar to the original decoder.

The proposed turbo decoder outperforms other turbo decoders for certain linear block codes.

The iterative decoding of GPCB-BCH (75, 51) approaches within 2.1dB of Shannon limit.

Abstract

Iterative decoding techniques have gain popularity due to their performance and their application in most communications systems. In this paper, we present a new application of our iterative decoder on the GPCB (Generalized Parallel Concatenated Block codes) which uses cyclic permutations. We introduce a new variant of the component decoder. After extensive simulation; the obtained result is very promising compared with several existing methods. We evaluate the effects of various parameters component codes, interleaver size, block size, and the number of iterations. Three interesting results are obtained; the first one is that the performances in terms of BER (Bit Error Rate) of the new constituent decoder are relatively similar to that of original one. Secondly our turbo decoding outperforms another turbo decoder for some linear block codes. Thirdly the proposed iterative decoding of GPCB-BCH (75, 51) is about 2.1dB from its Shannon limit.