Decoding Performance and Complexity Analysis of Single and Multi IRRWBF for LDPC Convolutional Codes

The Bit-Flipping (BF) binary decoding algorithm and its derived variants are mainly developed for LDPC codes, especially the Implementation-efficient Reliability Ratio-based Weighted Bit Flipping (IRRWBF) decoding which are hard decoding schemes based on bit-flipping in Galois Field-2 (GF-2), they are considered as low complexity decoding in comparison to soft decoding based on Belief Propagation (BP). This paper presents the BER performances of single and multi IRRWBF decoding algorithm applied to low-density parity-check convolutional codes (LDPC-CCs) and compared to the conventional LDPC codes. Simulation results demonstrate that multi IRRWBF (M-IRRWBF) achieves better performance compared to single IRRWBF (S-IRRWBF), at the expense of more operating complexity. Furthermore, we show that increasing the number of periods of the LDPC-CC parity-check matrix leads to performance improvement, which gives another advantage of LDPC-CCs over LDPC codes.