Improved decoding of LDPC codes by variable-To-check residual belief propagation

Lingyan Song, Shujuan Hou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 2015 10th International Conference on Communications and Networking in China, CHINACOM 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages163-166
Number of pages4
ISBN (Electronic)9781479987955
DOIs
Publication statusPublished - 22 Jun 2016
Event10th International Conference on Communications and Networking in China, CHINACOM 2015 - Shanghai, China
Duration: 15 Aug 201517 Aug 2015

Publication series

NameProceedings of the 2015 10th International Conference on Communications and Networking in China, CHINACOM 2015

Conference

Conference10th International Conference on Communications and Networking in China, CHINACOM 2015
Country/TerritoryChina
CityShanghai
Period15/08/1517/08/15

Keywords

  • LDPC codes
  • informed dynamic schedule (IDS)
  • lazy residual belief propagation (Lazy-RBP)
  • lazy schedule (LS)

Fingerprint

Dive into the research topics of 'Improved decoding of LDPC codes by variable-To-check residual belief propagation'. Together they form a unique fingerprint.

Cite this