Paper Info
Title
Finite-length analysis of the TEP decoder for LDPC ensembles over the BEC
Abstract
In this work, we analyze the finite-length performance of low-density parity check (LDPC) ensembles decoded over the binary erasure channel (BEC) using the tree-expectation propagation (TEP) algorithm. In a previous paper, we showed that the TEP improves the BP performance for decoding regular and irregular short LDPC codes, but the perspective was mainly empirical. In this work, given the degree-distribution of an LDPC ensemble, we explain and predict the range of code lengths for which the TEP improves the BP solution. In addition, for LDPC ensembles that present a single critical point, we propose a scaling law to accurately predict the performance in the waterfall region. These results are of critical importance to design practical LDPC codes for the TEP decoder.
Year
DOI
Venue
2012
10.1109/ISIT.2012.6283932
Information Theory Proceedings
Keywords
Field
DocType
binary codes,decoding,parity check codes,BEC,LDPC ensembles,TEP decoder,binary erasure channel,finite-length analysis,low-density parity check ensembles,tree-expectation propagation algorithm,waterfall region
Parity bit,Combinatorics,Error floor,Computer science,Low-density parity-check code,Binary code,Binary erasure channel,Critical point (thermodynamics),Decoding methods,Scaling law
Conference
ISSN
ISBN
Citations 
2157-8095 E-ISBN : 978-1-4673-2578-3
978-1-4673-2578-3
1
PageRank 
References 
Authors
0.35
7
6
Name
Order
Citations
PageRank
Pablo M. Olmos111418.97
Fernando Pérez-Cruz274961.24
Luis Salamanca3285.63
Juan José Murillo-Fuentes418223.93
Perez-Cruz, F.5745.00
Murillo-Fuentes, J.J.6376.55