DocumentCode :
2920097
Title :
Analysis of peeling decoder for MET ensembles
Author :
Hinton, Ryan W. ; Wilson, Stephen G.
Author_Institution :
L-3 Commun. CSW, Univ. of Virginia, Charlottesville, VA, USA
fYear :
2010
fDate :
6-8 Jan. 2010
Firstpage :
1
Lastpage :
5
Abstract :
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.
Keywords :
Markov processes; decoding; parity check codes; LDPC decoding; MET ensembles; Markov process; analogous differential equations; binary erasure channel; decoder state; finite-length ensemble behavior; graph connectivity; irregular ensembles; multi-edge type ensembles; peeling decoder; Belief propagation; Channel coding; Decoding; Difference equations; Differential equations; Markov processes; Parity check codes; Polynomials; Sockets; binary erasure channel (BEC); low-density parity-check (LDPC) codes; multi-edge type (MET) ensembles; peeling decoder;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on
Conference_Location :
Cairo
Print_ISBN :
978-1-4244-6372-5
Type :
conf
DOI :
10.1109/ITWKSPS.2010.5503138
Filename :
5503138
Link To Document :
بازگشت