Name
Abstract | ||
|---|---|---|
A reliability-based iterative majority-logic decoding algorithm for regular low-density parity-check (LDPC) codes was recently proposed by Huang et al. In this paper we present an improved version of that algorithm by introducing a different reliability measure for each check-sum of the parity-check matrix, and taking it into account in the computation of the extrinsic information that is used to update the reliability measure of each received bit in each iteration. Some simulations results are given, which show that the new algorithm, while requiring very little additional computational complexity, not only achieves a considerable error performance gain over the standard one, but also, importantly, outperforms the iterative decoding based on belief propagation (IDBP), especially for short and medium block length finite-geometry (FG) LDPC codes. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/icc.2011.5962811 | Communications |
Keywords | Field | DocType |
computational complexity,iterative decoding,parity check codes,check-sum,computational complexity,low-density parity-check code,medium block length finite-geometry LDPC code,near optimum majority-logic based decoding,parity-check matrix,reliability measure,reliability-based iterative majority-logic decoding algorithm,short block length finite-geometry LDPC code | Sequential decoding,Berlekamp–Welch algorithm,Parity-check matrix,Computer science,Low-density parity-check code,Algorithm,Theoretical computer science,Real-time computing,Decoding methods,List decoding,Computational complexity theory,Belief propagation | Conference |
ISSN | ISBN | Citations |
1550-3607 E-ISBN : 978-1-61284-231-8 | 978-1-61284-231-8 | 0 |
PageRank | References | Authors |
0.34 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Telex Magloire Nkouatchah Ngatched | 1 | 18 | 3.82 |
| Alfa, A.S. | 2 | 141 | 14.37 |
| Jun Cai | 3 | 373 | 39.29 |