Computer Science – Information Theory
Scientific paper
2009-11-09
Computer Science
Information Theory
Preprint of submission to Information Theory Workshop (ITW) 2010. 5 pages, two figures (from seven files). Processed with PDFL
Scientific paper
The peeling decoder introduced by Luby, et al. allows analysis of LDPC decoding for the binary erasure channel (BEC). For irregular ensembles, they analyze the decoder state as a Markov process and present a solution to the differential equations describing the process mean. Multi-edge type (MET) ensembles allow greater precision through specifying graph connectivity. We generalize the the peeling decoder for MET ensembles and derive analogous differential equations. We offer a new change of variables and solution to the node fraction evolutions in the general (MET) case. This result is preparatory to investigating finite-length ensemble behavior.
Hinton Ryan
Wilson Stephen G.
No associations
LandOfFree
Analysis of peeling decoder for MET ensembles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Analysis of peeling decoder for MET ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of peeling decoder for MET ensembles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-660635