Publication: A Differential Binary Message-Passing LDPC Decoder

All || By Area || By Year

Title A Differential Binary Message-Passing LDPC Decoder
Authors/Editors* N. Mobini, A. H. Banihashemi and S. Hemati
Where published* IEEE Globecom 2007
How published* Proceedings
Year* 2007
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.
Go to Wireless Communications
Back to page 59 of list