PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes
Pablo Olmos, Juan Jose Murillo-Fuentes and Fernando Perez-Cruz
IEEE Communications Letters Volume 15, Number 2, pp. 235-237, 2011. ISSN 1089-7798

Abstract

In this paper, we propose Tree-structured Expectation Propagation (TEP) algorithm to decode finite-length Low-Density Parity-Check (LDPC) codes. The TEP decoder is able to continue decoding once the standard Belief Propagation (BP) decoder fails, presenting the same computational complexity as the BP decoder. The BP algorithm is dominated by the presence of stopping sets (SSs) in the code graph. We show that the TEP decoder, without previous knowledge of the graph, naturally avoids some fairly common SSs. This results in a significant improvement in the system performance.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7546
Deposited By:Fernando Perez-Cruz
Deposited On:17 March 2011