2008 IEEE Wireless Communications and Networking Conference 2008
DOI: 10.1109/wcnc.2008.49
|View full text |Cite
|
Sign up to set email alerts
|

Decoding with Early Termination for Rateless (Luby Transform) Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…A common criterion for early termination of rateless decoding is observing if the estimated messages mv satisfy the constraints imposed by CNs [3,4]. The criterion controls whether the equation mc ⊕ v mv is equal to zero for all CNs, where mc stands for hard decision of mc messages, ⊕ represents modulo-2 addition and denotes the summation operator for modulo-2 addition.…”
Section: Csr Early Termination Methodmentioning
confidence: 99%
See 1 more Smart Citation
“…A common criterion for early termination of rateless decoding is observing if the estimated messages mv satisfy the constraints imposed by CNs [3,4]. The criterion controls whether the equation mc ⊕ v mv is equal to zero for all CNs, where mc stands for hard decision of mc messages, ⊕ represents modulo-2 addition and denotes the summation operator for modulo-2 addition.…”
Section: Csr Early Termination Methodmentioning
confidence: 99%
“…In literature, there are some early termination methods (ETMs) based on check-sum satisfaction ratio (CSR) for rateless codes [3]- [6]. CSR is a common success criterion for BP decoding algorithm to observe whether message estimation satisfies constraints imposed by check nodes.…”
mentioning
confidence: 99%