Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes Articles uri icon

authors

  • OLMOS, PABLO M.
  • MURILLO FUENTES, JUAN JOSE
  • PEREZ CRUZ, FERNANDO

publication date

  • February 2011

start page

  • 235

end page

  • 237

issue

  • 2

volume

  • 15

international standard serial number (ISSN)

  • 1089-7798

electronic international standard serial number (EISSN)

  • 1558-2558

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.

keywords

  • ldpc decoding ; tree-structured expectation propagation ; finite-length analysis