A new binary iterative LDPC decoding algorithm

We introduce a new binary message-passing decoding method for low-density parity-check (LDPC) codes. The proposed decoding principle does not require the degree information of variable nodes and can be applied to both timeinvariant and time-variant decoding algorithms. We present the extrinsic error probability analysis and decoding threshold optimization for the new decoding method in both time-invariant and time-variant decoding scenarios. Both theoretical analysis and numerical results show that the proposed method provides the same performance as the existing methods for both time-invariant and time-variant decoding, while the proposed new method facilitates efficient circuit implementations of the LDPC decoder since it does not require the degree information.