Name
Abstract | ||
|---|---|---|
Low-density parity-check convolutional (LDPCC) codes asymptotically achieve channel capacity under belief propagation (BP) decoding. In this paper, we decode LDPCC codes using the Tree-Expectation Propagation (TEP) decoder, recently proposed as an alternative decoding method to the BP algorithm for the binary erasure channel (BEC). We show that, for LDPCC codes, the TEP decoder improves the BP solution with a comparable complexity or, alternatively, it allows using shorter codes to achieve similar error rates. We also propose a window-sliding scheme for the TEP decoder to reduce the decoding latency. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/LCOMM.2012.030912.120092 | IEEE Communications Letters |
Keywords | Field | DocType |
Decoding,Convolutional codes,Complexity theory,Error analysis,Iterative decoding | Decoding latency,Convolutional code,Low-density parity-check code,Computer science,Binary erasure channel,Algorithm,Real-time computing,Theoretical computer science,Soft-decision decoder,Decoding methods,Channel capacity,Belief propagation | Journal |
Volume | Issue | ISSN |
16 | 5 | 1089-7798 |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pablo M. Olmos | 1 | 114 | 18.97 |
| Luis Salamanca | 2 | 28 | 5.63 |
| Juan José Murillo-Fuentes | 3 | 182 | 23.93 |
| Fernando Pérez-Cruz | 4 | 749 | 61.24 |