Name
Abstract | ||
|---|---|---|
In this paper, we put forward the tree-structured expectation propagation (TEP) algorithm for decoding block and convolutional low-density parity-check codes over any binary channel. We have already shown that TEP improves belief propagation (BP) over the binary erasure channel (BEC) by imposing marginal constraints over a set of pairs of variables that form a tree or a forest. The TEP decoder is a message-passing algorithm that sequentially builds a tree/forest of erased variables to capture additional information disregarded by the standard BP decoder, which leads to a noticeable reduction of the error rate for finite-length codes. In this paper, we show how the TEP can be extended to any channel, specifically to binary memoryless symmetric (BMS) channels. We particularly focus on how the TEP algorithm can be adapted for any channel model and, more importantly, how to choose the tree/forest to keep the gains observed for block and convolutional LDPC codes over the BEC. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TCOMM.2013.081913.130264 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Parity check codes,Decoding,Approximation methods,Complexity theory,Vegetation,Approximation algorithms,Probability density function | Concatenated error correction code,Sequential decoding,Convolutional code,Control theory,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Turbo code,Algorithm,Binary erasure channel,Theoretical computer science,Decoding methods | Journal |
Volume | Issue | ISSN |
61 | 10 | 0090-6778 |
Citations | PageRank | References |
4 | 0.40 | 21 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luis Salamanca | 1 | 28 | 5.63 |
| Pablo M. Olmos | 2 | 114 | 18.97 |
| Fernando Pérez-Cruz | 3 | 749 | 61.24 |
| Juan José Murillo-Fuentes | 4 | 182 | 23.93 |
| Perez-Cruz, F. | 5 | 4 | 0.40 |
| Murillo-Fuentes, J.J. | 6 | 37 | 6.55 |