Title :
A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains
Author :
Olmos, Pablo M. ; Mitchell, David ; Truhachev, Dmitry ; Costello, Daniel J.
Author_Institution :
Signal Theor. & Commun. Dept., Univ. Carlos III of Madrid, Leganes, Spain
Abstract :
The finite length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains is analyzed. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. It is shown that, in addition to superior iterative decoding thresholds, connected chain ensembles have better performance than single chain ensembles of the same rate and length.
Keywords :
binary codes; channel coding; graph theory; iterative decoding; parity check codes; BEC; SC-LDPC code chains; binary erasure channel; bipartite graph; connected chain ensembles; dynamical system; finite length performance analysis; iteration; iterative decoding thresholds; single chain ensembles; spatially coupled low-density parity-check code chains; successive peeling decoding; undecoded portion; Block codes; Couplings; Error probability; Iterative decoding; Joining processes; Maximum likelihood decoding;
Conference_Titel :
Information Theory Workshop (ITW), 2013 IEEE
Conference_Location :
Sevilla
Print_ISBN :
978-1-4799-1321-3
DOI :
10.1109/ITW.2013.6691239
