2010 6th International Symposium on Turbo Codes &Amp; Iterative Information Processing 2010
DOI: 10.1109/istc.2010.5613845
|View full text |Cite
|
Sign up to set email alerts
|

Robust clipping demapper for LDPC decoding in impulsive channel

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Besides, if we consider a family defined by a limited number of parameters and easy to implement, both the estimation and implementation complexities are reduced. This work can thus be seen as a generalization of some previous works that dealt with an approximation of the LLR function [8][9][10]: if the soft limiter and the hole puncher [11] are probably the best-known solutions, we previously proposed the approximation function f (y) = sgn(y) min(a|y|, b/|y|) [12], where sgn(y) extracts the sign of y. Nevertheless, we will not focus in this paper on the best family choice but on a generic way to estimate the approximation parameters in an unsupervised manner.…”
Section: Introductionmentioning
confidence: 96%
“…Besides, if we consider a family defined by a limited number of parameters and easy to implement, both the estimation and implementation complexities are reduced. This work can thus be seen as a generalization of some previous works that dealt with an approximation of the LLR function [8][9][10]: if the soft limiter and the hole puncher [11] are probably the best-known solutions, we previously proposed the approximation function f (y) = sgn(y) min(a|y|, b/|y|) [12], where sgn(y) extracts the sign of y. Nevertheless, we will not focus in this paper on the best family choice but on a generic way to estimate the approximation parameters in an unsupervised manner.…”
Section: Introductionmentioning
confidence: 96%