An implementation-friendly binary LDPC decoding algorithm

We introduce an implementation-friendly binary message-passing decoding method for low-density parity-check (LDPC) codes that does not require the degree information of variable nodes or degree dependent parameters. For hard decision decoding, given its low-complexity, the implementation cost for variable node degree information is an important consideration. We develop an estimation method for the extrinsic error probability (EEP) as well as its analysis. The proposed method offers similar performance as the existing methods for time-invariant decoding in most cases, while it facilitates efficient circuit implementations of the LDPC decoder.