An implementation-friendly binary LDPC decoding algorithm

Authors:
Guosen Yue;Xiaodong Wang
Affiliations:
NEC Laboratories America, Inc., Princeton, NJ;Dept. of Electrical Engineering, Columbia Univ., New York, NY
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 8
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Optimization of irregular repeat accumulate codes for MIMO systems with iterative receivers

IEEE Transactions on Wireless Communications
Improved low-density parity-check codes using irregular graphs

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

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
Properties of optimum binary message-passing decoders

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.