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: | Huilian Zhang, Shaoping Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8641399/ |
Similar Items
-
Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes
by: BOT, A., et al.
Published: (2013-11-01) -
Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
by: Aslam, Chaudhry Adnan, et al.
Published: (2015) -
A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding
by: Ruijia Yuan, et al.
Published: (2022-01-01) -
Design and Analysis of Joint Group Shuffled Scheduling Decoding Algorithm for Double LDPC Codes System
by: Qiwang Chen, et al.
Published: (2023-02-01) -
Design of A Parallel Decoding Method for LDPC Code Generated via Primitive Polynomial
by: Zhe Zhang, et al.
Published: (2021-02-01)