Name
Abstract | ||
|---|---|---|
Non-binary low-density parity-check (NB-LDPC) codes are known to offer several advantages over their binary counterparts, but the higher complexity, and the resource-hungry nature of decoding algorithms have so far restricted their practical usage. In this paper, we propose a new decoding algorithm for NB-LDPC codes over finite fields of characteristic 2, based on a novel
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">binary</italic>
expansion of the
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${Q}$ </tex-math></inline-formula>
-ary Tanner graph. While it offers substantial complexity gains, simulation results demonstrate that the performance loss of the new algorithm, in comparison to the best known decoder, is quite small. Furthermore, due to being based on a binary graph, it is particularly attractive for hardware implementations. We also suggest a simplified version of the algorithm, which offers even higher gains in complexity. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TCOMM.2019.2961884 | IEEE Transactions on Communications |
Keywords | DocType | Volume |
Non-binary LDPC codes,graph expansion,iterative decoding | Journal | 68 |
Issue | ISSN | Citations |
3 | 0090-6778 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. B. Wijekoon | 1 | 0 | 1.69 |
| Emanuele Viterbo | 2 | 113 | 9.56 |
| Yi Hong | 3 | 62 | 5.41 |
| Rino Micheloni | 4 | 69 | 12.85 |
| alessia marelli | 5 | 20 | 3.64 |