Improving Performance of the Min Sum Algorithm for LDPC Codes

In this paper we develop an algorithm for decoding low-density parity-check (LDPC) code that improve performance and reduce latency time. This algorithm is called Variable Factor Appearance Probability Min Sum (VFAP-MS) and is inspired from the Variable Factor Appearance Probability Belief Propagation (VFAP-BP) algorithm. The presented algorithm exploit the existence of short cycles in the code and strategy for reweighting check nodes, and is suitable for wireless communications applications. Simulation results show that the VFAP-MS algorithm outperforms the standard MS described in the literature.

[1]  Tinoosh Mohsenin,et al.  Split-Row: A Reduced Complexity, High Throughput LDPC Decoder Architecture , 2006, 2006 International Conference on Computer Design.

[2]  Henk Wymeersch,et al.  Uniformly Reweighted Belief Propagation for Estimation and Detection in Wireless Networks , 2012, IEEE Transactions on Wireless Communications.

[3]  Keith M. Chugg,et al.  An algorithm for counting short cycles in bipartite graphs , 2006, IEEE Transactions on Information Theory.

[4]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[5]  D. Spielman,et al.  Expander codes , 1996 .

[6]  Rodrigo C. de Lamare,et al.  Low-Latency Reweighted Belief Propagation Decoding for LDPC Codes , 2012, IEEE Communications Letters.

[7]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[8]  Rodrigo C. de Lamare,et al.  Knowledge-aided reweighted belief propagation decoding for regular and irregular LDPC codes with short blocks , 2012, 2012 International Symposium on Wireless Communication Systems (ISWCS).

[9]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[10]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .