2011 IEEE Global Telecommunications Conference - GLOBECOM 2011 2011
DOI: 10.1109/glocom.2011.6133650
|View full text |Cite
|
Sign up to set email alerts
|

Error Floor Analysis of LT Codes over the Additive White Gaussian Noise Channel

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
80
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 72 publications
(81 citation statements)
references
References 12 publications
1
80
0
Order By: Relevance
“…Therefore, besides the SNR, the assumption of perfect messages is still asymptotically true when the overhead tends to infinity. We extend the work in [10] to our investigation on SLT codes and derive the lower bound on BER of SLT codes. Second, we adopt a conventional linear programming (CLP) method constrained by the GA to optimize the degree distribution, which is straightforwardly extended from the work on nonsystematic fountain codes [6].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, besides the SNR, the assumption of perfect messages is still asymptotically true when the overhead tends to infinity. We extend the work in [10] to our investigation on SLT codes and derive the lower bound on BER of SLT codes. Second, we adopt a conventional linear programming (CLP) method constrained by the GA to optimize the degree distribution, which is straightforwardly extended from the work on nonsystematic fountain codes [6].…”
Section: Introductionmentioning
confidence: 99%
“…Ref. [10] derived the lower bound on BER for LT codes, and the authors used the assumption that the messages passed from variable nodes to check nodes in the final decoding iteration are perfect when the SNR tends to infinity. Our work will present that the overhead is an important factor for realizing successful decoding.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Both LT codes have an error floor, which is a well-known drawback of many designs of these codes. It has recently been shown in [21] that by shaping the input symbol degree distribution, the error floor can be mitigated. The problem can also be mitigated through precoding, as is done with Raptor codes.…”
Section: B Achieving the Target Ripple Size Evolutionmentioning
confidence: 99%
“…Similar to LDPC codes [7], to recover the input symbols, the belief propagation (BP) decoding algorithm is used on noisy channels [8]. However, LT codes still suffer error floor on noisy channels [9].…”
Section: Introductionmentioning
confidence: 99%