Research Article
Improved Decoding of LDPC Codes by Variable-to-check Residual Belief Propagation
@INPROCEEDINGS{10.4108/eai.15-8-2015.2260668, author={Lingyan Song and Shujuan Hou}, title={Improved Decoding of LDPC Codes by Variable-to-check Residual Belief Propagation}, proceedings={10th EAI International Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2015}, month={9}, keywords={ldpc codes lazy residual belief propagation (lazy-rbp) lazy schedule (ls) informed dynamic schedule (ids)}, doi={10.4108/eai.15-8-2015.2260668} }- Lingyan Song
Shujuan Hou
Year: 2015
Improved Decoding of LDPC Codes by Variable-to-check Residual Belief Propagation
CHINACOM
IEEE
DOI: 10.4108/eai.15-8-2015.2260668
Abstract
This paper proposes an improved variable-to-check residual belief propagation algorithm, called Lazy-RBP, in which a new informed dynamic schedule (IDS) combined with the lazy schedule (LS) is adopted. Firstly, Lazy-RBP exploits the probabilistic girth-based approach, one of the LS strategies, to decide the set of updated variable nodes in each iteration. Then among this set, a new IDS scheme is introduced, where both the unreliable variable nodes and the residual of the variable-to-check messages are utilized to locate the message to be propagated first. Simulation results show that the Lazy-RBP algorithm can not only improve the error performance but accelerate the convergence compared with the VC-RBP algorithm.
Copyright © 2015–2024 IEEE
