2019
DOI: 10.1007/s10766-019-00632-3
|View full text |Cite
|
Sign up to set email alerts
|

GPU Accelerated Parallel Algorithm of Sliding-Window Belief Propagation for LDPC Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…In optimization aspect, investigators primarily focus on implementation and convergence condition. Furthermore, LDPC along computational process assists in parallelization and merging memory access [36]. Beside this, convergence problem of BP and numerical polynomialhomotopy-continuation method revealed influence of structures.…”
Section: Belief Propagationmentioning
confidence: 99%
“…In optimization aspect, investigators primarily focus on implementation and convergence condition. Furthermore, LDPC along computational process assists in parallelization and merging memory access [36]. Beside this, convergence problem of BP and numerical polynomialhomotopy-continuation method revealed influence of structures.…”
Section: Belief Propagationmentioning
confidence: 99%
“…In optimization aspect, investigators primarily focus on implementation and convergence condition. Furthermore, LDPC along computational process assists in parallelization and merging memory access [37]. Beside this, convergence problem of BP algorithm and numerical polynomial-homotopy-continuation method revealed influence of structures.…”
Section: Belief Propagationmentioning
confidence: 99%
“…Zhang et al proved that the Gaussian BP algorithm is exponentially convergent under the condition of walk summability, and gave a boundary of convergence rate [36]. Shan et al proposed sliding window belief propagation decoding algorithm of LDPC, and optimized the computational efficiency of propagation process with parallelization and merging memory access [37]. Knoll et al studied the convergence problem of BP algorithm and proposed the numerical polynomial-homotopy-continuation method, which revealed the influence of the structures and parameters of graph models on the convergence by solving the fixed points [38].…”
Section: Belief Propagationmentioning
confidence: 99%