Efficient Stochastic Decoding of Non-Binary LDPC Codes with Degree-Two Variable Nodes

In this letter, we present an optimized version of the relaxed half-stochastic (RHS) algorithm targeted at non-binary LDPC codes with a variable node degree equal to two. The new algorithm has significantly fewer multiplications while maintaining an error-correction performance and a decoding iteration count identical to those of the original.

[1]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[2]  Shie Mannor,et al.  Stochastic Decoding of LDPC Codes over GF(q) , 2013, IEEE Transactions on Communications.

[3]  David Declercq,et al.  Performance Evaluation of Non-Binary LDPC Codes on Wireless Channels , 2009 .

[4]  David Declercq,et al.  Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ , 2007, IEEE Transactions on Communications.

[5]  S. Leigh,et al.  Probability and Random Processes for Electrical Engineering , 1989 .

[6]  David Declercq,et al.  Low-complexity decoding for non-binary LDPC codes in high order fields , 2010, IEEE Transactions on Communications.

[7]  Qin Huang,et al.  Two Low-Complexity Reliability-Based Message-Passing Algorithms for Decoding Non-Binary LDPC Codes , 2010, IEEE Transactions on Communications.

[8]  Warren J. Gross,et al.  Relaxed half-stochastic decoding of LDPC codes over GF(q) , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Warren J. Gross,et al.  Reduced-latency stochastic decoding of LDPC codes over GF(q) , 2010, 2010 European Wireless Conference (EW).

[10]  D. Mackay,et al.  Low density parity check codes over GF(q) , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).