In this paper, we propose a binary message-passing algorithm for decoding low-density parity-check (LDPC) codes. The algorithm substantially improves the performance of purely hard-decision iterative algorithms with a small increase in the memory requirements and the computational complexity. We associate a reliability value to each nonzero element of the code's parity-check matrix, and differentially modify this value in each iteration based on the sum of the extrinsic binary messages from the check nodes. For the tested random and finite-geometry LDPC codes, the proposed algorithm can achieve performance as close as 1.3 dB and 0.7 dB to that of belief propagation (BP) at the error rates of interest, respectively. This is while, unlike BP, the algorithm does not require the estimation of channel signal to noise ratio. Low memory and computational requirements and binary message-passing make the proposed algorithm attractive for high-speed low-power applications.

Additional Metadata
Persistent URL dx.doi.org/10.1109/GLOCOM.2007.300
Conference 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
Citation
Mobini, N. (Nastaran), Banihashemi, A, & Hemati, S. (Saied). (2007). A differential binary message-passing LDPC decoder. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 1561–1565). doi:10.1109/GLOCOM.2007.300