2008
DOI: 10.1109/lcomm.2008.080260
|View full text |Cite
|
Sign up to set email alerts
|

Decoding with Early Termination for Raptor Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…When the channel cannot be modeled as an erasure channel, the integration of newly arrived samples into message-passing decoding is somewhat more complicated. For this case, favorable decoding schedules are described in [25] and [26].…”
Section: Methodsmentioning
confidence: 99%
“…When the channel cannot be modeled as an erasure channel, the integration of newly arrived samples into message-passing decoding is somewhat more complicated. For this case, favorable decoding schedules are described in [25] and [26].…”
Section: Methodsmentioning
confidence: 99%
“…If the difference in CSR between two consecutive iterations (denoted as ΔCSR) has a value of 0 for Γ TS consecutive iterations, the decoder is likely stuck in a TS [16, 26]. Our simulations of various LT codes have indicated that the majority of the TSs occurring at high CSRs are in fact ASs.…”
Section: Towards a New Fountain Codecmentioning
confidence: 95%
“…Heo et al [12] also proposed their incremental Raptor decoders. Furthermore, Chen et al [13], [14] proposed their refined versions of Raptor incremental decoder based on the IDIDS (incremental decoding with informed dynamic scheduling) algorithms, and the total number of decoding iterations can be further reduced to less than 50% of the conventional ones [15].…”
Section: Related Workmentioning
confidence: 99%