A low complexity extrinsic message based decoding algorithm for non-binary LDPC codes

In this paper, we propose a low complexity extrinsic message based decoding algorithm for non-binary LDPC codes. This algorithm only requires computations over finite field and integer operations. The novelty of this decoding algorithm lies in that we compute extrinsic message and iteratively update the messages in every iteration. The proposed algorithm provides effective trade-off between computational complexity and performance. Furthermore, complexity issues and decoding performance will be well analyzed in this paper. Simulation results show that we can achieve a better performance than ISRB algorithm with a slight increase in computational complexity.