Bit Flipping-Sum Product Algorithm for regular LDPC codes
Rachid El Alami, Cheikh Bamba Gueye, Mohammed Boussetta +2 more
In this paper we present Low Density Parity Check decoding algorithm that assemble two different algorithms: Sum-Product and Bit-Flipping; we denote Bit Flipping-Sum Product Algorithm (BFSP). To reduce the bit error rate, we perform the Bit-Flipping algorithm after the Sum-Product algorithm. Simulation results over an additive white Gaussian channel show that the error performance of a LDPC codes with Bit Flipping-Sum Product decoding is within 0.2 dB of the standard Sum-Product decoding algorithms. Furthermore, the decoding complexity of the proposed BFSP algorithm is maintained at the same level as that of the standard Sum-Product algorithm.
International Symposium on I/V Communications and Mobile Network (ISIVC)•Sep 1, 2010•3 citations