Performance Evaluation of Bit-Flipping Based Algorithms for LDPC Convolutional Codes

Abstract

It has previously been shown that ensembles of terminated LDPC convolutional codes (LDPC-CC) have an error performance comparable to that of their counterparts LDPC codes. Also they are capable of achieving capacity approaching performance with iterative message-passing decoding on the AWGN channel. In terms of complexity, throughput and latency of iterative decoding algorithms, various interesting tradeoffs have been compared between the two different types of codes. In this paper, we review Bit-Flipping (BF) decoding algorithm and its variants. We adapt BF, WBF (Weighted Bit-Flipping), MWBF (Improved Weighted Bit-Flipping) and IRRWBF (Implementation-Efficient Reliability Ratio-based WBF) decoding variants, in order to evaluate the bit error rate (BER) performance of LDPC-CCs. Extensive computer simulations and comparisons are provided to demonstrate the efficiency of LDPC-CCs and the differences between the considered variants of BF decoding algorithm.