Name
Abstract | ||
|---|---|---|
In this paper, we propose a decoding algorithm for LDPC codes that achieves the MAP solution over the BEC. This algorithm, denoted as generalized tree-structured expectation propagation (GTEP), extends the idea of our previous work, the TEP decoder. The GTEP modifies the graph by eliminating a check node of any degree and merging this information with the remaining graph. The GTEP decoder upon completion either provides the unique MAP solution or a tree graph in which the number of parent nodes indicates the multiplicity of the MAP solution. This algorithm can be easily described for the BEC, and it can be cast as a generalized peeling decoder. The GTEP naturally optimizes the complexity of the decoder, by looking for checks nodes of minimum degree to be eliminated first. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ITW.2011.6089364 | 2011 IEEE INFORMATION THEORY WORKSHOP (ITW) |
Keywords | Field | DocType |
MAP decoding, LDPC codes, tree-structured expectation propagation, graphical models | Discrete mathematics,Tree (graph theory),Computer science,Low-density parity-check code,Binary erasure channel,Theoretical computer science,Soft-decision decoder,Graphical model,Decoding methods,Expectation propagation,Computational complexity theory | Conference |
Citations | PageRank | References |
1 | 0.35 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luis Salamanca | 1 | 28 | 5.63 |
| Pablo M. Olmos | 2 | 114 | 18.97 |
| Juan José Murillo-Fuentes | 3 | 182 | 23.93 |
| Fernando Pérez-Cruz | 4 | 749 | 61.24 |