Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
Belief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. Among them, residual belief-propagation (RBP), which is the most primitive and representative informed dynamic scheduling (IDS) strategy, can significantly accelerate the convergence...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8641399/ |
id |
doaj-48f273cb9499426789263e89fc6d4e5b |
---|---|
record_format |
Article |
spelling |
doaj-48f273cb9499426789263e89fc6d4e5b2021-03-29T22:38:44ZengIEEEIEEE Access2169-35362019-01-017236562366610.1109/ACCESS.2019.28991068641399Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC CodesHuilian Zhang0https://orcid.org/0000-0002-8342-2246Shaoping Chen1Hubei Key Laboratory of Intelligent Wireless Communications, South-Central University for Nationalities, Wuhan, ChinaHubei Key Laboratory of Intelligent Wireless Communications, South-Central University for Nationalities, Wuhan, ChinaBelief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. Among them, residual belief-propagation (RBP), which is the most primitive and representative informed dynamic scheduling (IDS) strategy, can significantly accelerate the convergence speed. However, RBP decoding suffers from a poor convergence error-rate performance due to its greedy property, which is one of the challenging issues in the design of IDS strategies. To tackle this problem, a novel IDS scheme, namely residual-decaying-based residual belief-propagation (RD-RBP) algorithm, is presented in this paper. In RD-RBP, a decaying mechanism is introduced to manipulate the residuals of those check-to-variable messages, preventing the decoding resources from being unreasonably occupied by a small group of edges in the Tanner graph. The greediness is therefore alleviated and better performance of convergence error-rate is achieved. Besides, a two-stage scheduling scheme combining prior-art variable-node and variable-to-check-edge RBP (V-VCRBP) with RD-RBP, named V-VC-RD-RBP, is proposed for achieving both fast convergence speed and a low convergence error-rate. The simulation results validate the advantages of the proposed schemes.https://ieeexplore.ieee.org/document/8641399/LDPC codesbelief-propagation decodinginformed dynamic schedulingresidual-decayinggreediness |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Huilian Zhang Shaoping Chen |
spellingShingle |
Huilian Zhang Shaoping Chen Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes IEEE Access LDPC codes belief-propagation decoding informed dynamic scheduling residual-decaying greediness |
author_facet |
Huilian Zhang Shaoping Chen |
author_sort |
Huilian Zhang |
title |
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes |
title_short |
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes |
title_full |
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes |
title_fullStr |
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes |
title_full_unstemmed |
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes |
title_sort |
residual-decaying-based informed dynamic scheduling for belief-propagation decoding of ldpc codes |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
Belief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. Among them, residual belief-propagation (RBP), which is the most primitive and representative informed dynamic scheduling (IDS) strategy, can significantly accelerate the convergence speed. However, RBP decoding suffers from a poor convergence error-rate performance due to its greedy property, which is one of the challenging issues in the design of IDS strategies. To tackle this problem, a novel IDS scheme, namely residual-decaying-based residual belief-propagation (RD-RBP) algorithm, is presented in this paper. In RD-RBP, a decaying mechanism is introduced to manipulate the residuals of those check-to-variable messages, preventing the decoding resources from being unreasonably occupied by a small group of edges in the Tanner graph. The greediness is therefore alleviated and better performance of convergence error-rate is achieved. Besides, a two-stage scheduling scheme combining prior-art variable-node and variable-to-check-edge RBP (V-VCRBP) with RD-RBP, named V-VC-RD-RBP, is proposed for achieving both fast convergence speed and a low convergence error-rate. The simulation results validate the advantages of the proposed schemes. |
topic |
LDPC codes belief-propagation decoding informed dynamic scheduling residual-decaying greediness |
url |
https://ieeexplore.ieee.org/document/8641399/ |
work_keys_str_mv |
AT huilianzhang residualdecayingbasedinformeddynamicschedulingforbeliefpropagationdecodingofldpccodes AT shaopingchen residualdecayingbasedinformeddynamicschedulingforbeliefpropagationdecodingofldpccodes |
_version_ |
1724191148964052992 |