Bubble check: a simplified algorithm for elementary check node processing in extended min-sum non-binary LDPC decoders

A simplified algorithm for the check node processing of extended min-sum non-binary LDPC decoders is proposed. This novel technique, named bubble check, can reduce the number of compare operations by a factor of three at the elementary check node level. As this significant complexity reduction is achieved without any performance loss, this technique becomes highly attractive for hardware implementation.

[1]  David Declercq,et al.  Low-Complexity, Low-Memory EMS Algorithm for Non-Binary LDPC Codes , 2007, 2007 IEEE International Conference on Communications.

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

[3]  Emmanuel Boutillon,et al.  Complexity Comparison of Non-Binary LDPC Decoders , 2009 .

[4]  Valentin Savin,et al.  Min-Max decoding for non binary LDPC codes , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  Henk Wymeersch,et al.  Log-domain decoding of LDPC codes over GF(q) , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[6]  David Declercq,et al.  Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images , 2008, IEEE Transactions on Communications.