2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) 2011
DOI: 10.1109/allerton.2011.6120169
|View full text |Cite
|
Sign up to set email alerts
|

Error floor approximation for LDPC codes in the AWGN channel

Abstract: This paper addresses the prediction of error floors of variable-regular Low Density Parity Check (LDPC) codes in the Additive White Gaussian Noise (AWGN) channel. Specifically, we focus on the Sum-Product Algorithm (SPA) decoder in the log-domain at high SNRs. We hypothesize that several published error floor levels are due to numerical saturation within their decoders when handling high SNRs. We take care to develop a log-domain SPA decoder that does not saturate near-certain messages and find the error rates… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
82
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(84 citation statements)
references
References 47 publications
2
82
0
Order By: Relevance
“…In this section, we propose a reduced complexity method to approximate λ(A). Although the term Pr (U = W k ) was eliminated from the expression for Pr(ξ(A)) in (16), thus making the lower bound code-independent and simplifying the expression, calculating λ(A) in (17) still depends on finding Ψ(W ), which, in-turn requires examining all W k ∈ W as shown in (15). In other words, all t κp rows of the decodability array should be examined for each of the t a columns x i .…”
Section: B Approximating the Lower Bound On Fermentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we propose a reduced complexity method to approximate λ(A). Although the term Pr (U = W k ) was eliminated from the expression for Pr(ξ(A)) in (16), thus making the lower bound code-independent and simplifying the expression, calculating λ(A) in (17) still depends on finding Ψ(W ), which, in-turn requires examining all W k ∈ W as shown in (15). In other words, all t κp rows of the decodability array should be examined for each of the t a columns x i .…”
Section: B Approximating the Lower Bound On Fermentioning
confidence: 99%
“…Also, [14] and [15] developed a state-space model for a codes dominant absorbing sets to estimate its FER. Later, [16] applied this method to the case where the log-likelihood-ratios (LLRs) used for decoding are constrained to some maximum saturation value. Each of these references considered the problematic structures of a particular code.…”
Section: Introductionmentioning
confidence: 99%
“…We note that the Margulis code is well know for its error floor in the AWGN channel [16]. The "nonsaturating BP" is a robust BP implementation that avoids saturating the log-likelihood ratios of the sum-product BP decoder (see [17] for details), thereby improving decoding performance in the error floor regime. Note that the LPD displays worse performance than BP at low SNRs.…”
Section: B Wer Performancementioning
confidence: 99%
“…Analyzing the error floor is a hard task as extracting analytical equations is near impossible. Very few papers tackle this approach [7], [8]. Three main strategies are followed to fight against the error floor.…”
Section: Introductionmentioning
confidence: 99%