Accelerated Q-ary low-density parity-check codes decoding with message selection

Authors:
X. H. Shen;F. C. M. Lau
Affiliations:
Department of Electronic and Information Engineering, The Hong Kong Polytechnic University;Department of Electronic and Information Engineering, The Hong Kong Polytechnic University
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 2
Cited 0

Information Theory, Inference & Learning Algorithms

Information Theory, Inference & Learning Algorithms
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Immediate generalization of Gallager's binary low-density parity-check (LDPC) codes gave birth to the LDPC codes over GF(q), which demonstrated error performance exceeding that of binary codes with compromised complexity. Various methods had been proposed for the decoder with an aim to simplifying the belief propagation algorithm. One of the algorithms was the "extended min-sum (EMS)" decoder which concerned only a limited number of incoming messages at the checks. In this paper, we propose a modification to further simplify the EMS decoder without sacrificing performance.