2021
DOI: 10.1109/tcomm.2021.3078776
|View full text |Cite
|
Sign up to set email alerts
|

Belief-Propagation Decoding of LDPC Codes With Variable Node–Centric Dynamic Schedules

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…These collective benefits position BP decoding as a preferred method for LDPC code decoding across various modern communication systems. The following describes the step-by-step process of the BP decoding algorithm in detail [18].…”
Section: Ldpc Decoding Algorithmmentioning
confidence: 99%
“…These collective benefits position BP decoding as a preferred method for LDPC code decoding across various modern communication systems. The following describes the step-by-step process of the BP decoding algorithm in detail [18].…”
Section: Ldpc Decoding Algorithmmentioning
confidence: 99%
“…It can be observed that N s is the nearest integer rounded to the product of the mini-batch size N b and the set of the SNR ratios (lines 2). As the summation of N s should equal N b , we may need to randomly adjust (add or delete) the value of N s (lines [5][6][7][8][9][10][11][12][13][14][15].…”
Section: Trainingmentioning
confidence: 99%
“…In [8], one simple method with less complex arithmetic operations to find the offset correction factor had been demonstrated. Chang et al [9] proposed a conditional variable node (VN) selecting metric to realize informed dynamic scheduling (IDS) LDPC decoding schedules. The goal is to find VNs with probable incorrect decisions and correct the errors by updating them.…”
Section: Introductionmentioning
confidence: 99%
“…There are two categories of schedules. One is dynamic [8][9][10][11][12][13][14] whose order is determined online, while the other is static [15][16][17][18][19][20] whose order is decided offline and kept fixed during the decoding. Usually dynamic schedules have better error performance and faster convergence speed since the real-time information is used to determine the optimal order.…”
mentioning
confidence: 99%