A differential binary message-passing LDPC decoder

Authors:
Nastaran Mobini;Amir H. Banihashemi;Saied Hemati
Affiliations:
Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada;Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada;Department of Electrical and Computer Engineering, McGill University, Montreal, Quebec, Canada
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 6
Cited 1

The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A

IEEE Transactions on Information Theory
Improved bit-flipping decoding of low-density parity-check codes

IEEE Transactions on Information Theory
Constructing free-energy approximations and generalized belief propagation algorithms

IEEE Transactions on Information Theory
Iterative reliability-based decoding of low-density parity check codes

IEEE Journal on Selected Areas in Communications

Nonbinary LDPC codes constructed based on a cyclic MDS code and a low-complexity nonbinary message-passing decoding algorithm

IEEE Communications Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 perform as close as about 1 dB and 0.5 dB to 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.