Abstract | ||
---|---|---|
A novel decoding algorithm for non-binary low density parity check (NB-LDPC) codes is proposed. The algorithm builds on the recently designed parallel symbol-flipping decoding (PSFD) algorithm and combines a technique of error estimation and a method of multiple voting levels from each unsatisfied check-sum to the corresponding variable nodes. Simulations results, performed on a number of NB-LDPC codes of various lengths and column weights constructed using several methods, show that the new algorithm not only avoids using code-dependent voting threshold but also improves the error rate performance of the PSFD algorithm, particularly for low column weight parity-check matrices. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/LCOMM.2015.2418260 | IEEE Communications Letters |
Keywords | Field | DocType |
Decoding,Complexity theory,Iterative decoding,Bit error rate,Algorithm design and analysis,Signal to noise ratio | Concatenated error correction code,Sequential decoding,Berlekamp–Welch algorithm,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Word error rate,Algorithm,Decoding methods,List decoding | Journal |
Volume | Issue | ISSN |
19 | 6 | 1089-7798 |
Citations | PageRank | References |
4 | 0.46 | 6 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Nhat-Quang Nhan | 1 | 10 | 2.58 |
Telex Magloire Nkouatchah Ngatched | 2 | 84 | 19.21 |
Octavia A. Dobre | 3 | 2064 | 181.08 |
Philippe Rostaing | 4 | 53 | 8.82 |
Karine Amis | 5 | 75 | 17.77 |
Emanuel Radoi | 6 | 79 | 15.62 |