Fast communication: MB iterative decoding algorithm on systematic LDGM codes: Performance evaluation

Authors:
Cheng-Chun Chang;Zhi-Hong Mao;Heung-No Lee
Affiliations:
Department of Electrical and Computer Engineering, University of Pittsburgh, Pittsburgh, PA, USA;Department of Electrical and Computer Engineering, University of Pittsburgh, Pittsburgh, PA, USA;Gwangju Institute of Science and Technology (GIST), Republic of Korea
Venue:
Signal Processing
Year:
2010

Citing 5
Cited 0

Practical loss-resilient codes

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
LDGM codes for channel coding and joint source-channel coding of correlated sources

EURASIP Journal on Applied Signal Processing
Modern Coding Theory

Modern Coding Theory
A recursive approach to low complexity codes

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

Quantified Score

Hi-index	0.08

Visualization

Abstract

We investigate the performance of regular systematic low-density generator matrix (LDGM) codes under the majority rule based (MB) iterative decoding algorithm. We derive a recursive form which can be used to extract the error performance of the code. Based on the recursive expression, we derive a tight non-recursive lower bound. These results can serve as efficient tools to evaluate the performance of the code for different degrees.