Tree expectation propagation for ML decoding of LDPC codes over the BEC Articles uri icon

publication date

  • December 2012

start page

  • 465

end page

  • 473


  • 2


  • 61

International Standard Serial Number (ISSN)

  • 0090-6778

Electronic International Standard Serial Number (EISSN)

  • 1558-0857


  • We propose a decoding algorithm for LDPC codes that achieves the maximum likelihood (ML) solution over the binary erasure channel (BEC). In this channel, the tree-structured expectation propagation (TEP) decoder improves the peeling decoder (PD) by processing check nodes of degree one and two. However, it does not achieve the ML solution, as the tree structure of the TEP allows only for approximate inference. In this paper, we provide the procedure to construct the structure needed for exact inference. This algorithm, denoted as generalized tree-structured expectation propagation (GTEP), modifies the code graph by recursively eliminating any check node and merging this information in the remaining graph. The GTEP decoder upon completion either provides the unique ML solution or a tree graph in which the number of parent nodes indicates the multiplicity of the ML solution. We also explain the algorithm as a Gaussian elimination method, relating the GTEP to other ML solutions. Compared to previous approaches, it presents an equivalent complexity, it exhibits a simpler graphical message-passing procedure and, most interesting, the algorithm can be generalized to other channels.


  • ml decoding; ldpc codes; tree-structured expectation propagation; graphical models; binary erasure channel