2021 International Symposium on Electrical and Electronics Engineering (ISEE) 2021
DOI: 10.1109/isee51682.2021.9418782
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Offset Min-Sum LDPC Decoding Algorithm for 5G New Radio

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
0
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 9 publications
0
0
0
Order By: Relevance
“…The HOMS is set with β = 0.5 and δ = 0.375 [19]. For comparison purposes, the performances of the NMS (1/α = 0.75) [14], OMS (β = 0.5) [14], IOMS ( γ = 0.875 and η = 0.5) [16], SMA-MSA ( α2 = 0.25 and γ = 0.75) [17], S2DS [18], and VOMS ( β = 0.5 and τ = 0.875) [19] algorithms are also evaluated.…”
Section: Performance Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The HOMS is set with β = 0.5 and δ = 0.375 [19]. For comparison purposes, the performances of the NMS (1/α = 0.75) [14], OMS (β = 0.5) [14], IOMS ( γ = 0.875 and η = 0.5) [16], SMA-MSA ( α2 = 0.25 and γ = 0.75) [17], S2DS [18], and VOMS ( β = 0.5 and τ = 0.875) [19] algorithms are also evaluated.…”
Section: Performance Resultsmentioning
confidence: 99%
“…In an effort to improve this performance loss, numerous approaches have been presented in the state-of-the-art, including some well-known algorithms such as the Offset Min-Sum (OMS) and the Normalized Min-Sum (NMS) [14,15]. Moreover, several enhancements have been further proposed in the literature, such as the Improved Offset Min-Sum (IOMS) algorithm [16], the Second Minimum Approximation Min-Sum algorithm (SMA-MSA) [17], the Simplified 2-Dimensional Scaled (S2DS) algorithm [18], the Hybrid Offset Min-Sum (HOMS), and the Variable Offset Min-Sum (VOMS) algorithms [19].…”
Section: Introductionmentioning
confidence: 99%
“…Although Min-Sum decoding consumes fewer hardware resources than Belief-Propagation (known as the best decoding algorithm), error correction performance is not good enough because of the overestimation issue of checknode messages. To compensate for this overestimation, many approaches have been proposed in the literature, which aim to improve error correction capacity [27][28][29][30][31][32][33][34][35]. However, the limitation of these algorithms is the existing error-floor when the SNR is high.…”
Section: The Proposed Decoding Algorithmmentioning
confidence: 99%
“…This iterative process continuously proceeds until the correct codeword is successfully found or until the maximum number of iterations has been reached. Depending on the update rules that are used to compute check and variable-node messages, there are several message-passing decoding algorithms, such as Belief-Propagation (BP), Min-Sum (MS), and MS-based algorithms [27][28][29][30][31][32][33][34][35]. Although MS and MS-based algorithms have lower error correction capacity than BP, they are simpler and more suitable for hardware implementations.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation