A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes
Abstract
Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and memory usage. Based on the combinatorial optimization, we present an approximation method for the check node processing. The simulation results demonstrate that our scheme has small performance loss over the additive white Gaussian noise channel and independent Rayleigh fading channel. Furthermore, the proposed reduced-complexity realization provides significant savings on hardware, so it yields a good performance-complexity tradeoff and can be efficiently implemented.
Cite
@article{arxiv.1207.5555,
title = {A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes},
author = {Chung-Li Wang and Xiaoheng Chen and Zongwang Li and Shaohua Yang},
journal= {arXiv preprint arXiv:1207.5555},
year = {2016}
}
Comments
Partially presented in ICNC 2012, International Conference on Computing, Networking and Communications. Accepted by IEEE Transactions on Communications