Name
Abstract | ||
|---|---|---|
In this paper, we consider the performance of the Noisy Gradient Descent Bit Flipping (NGDBF) algorithm under re-decoding of failed frames. NGDBF is a recent algorithm that uses a non-deterministic gradient descent search to decode low-density parity check (LDPC) codes. The proposed re-decode procedure obtains improved performance because the perturbations are independent at each re-decoding phase, therefore increasing the likelihood of successful decoding. We examine the benefits of re-decoding for an LDPC code from the IEEE 802.3an standard, and find that only a small fraction of re-decoded frames are needed to obtain significant performance benefits. When re-decoding is used, the NGDBF performance is very close to a benchmark offset min-sum decoder for the 802.3an code. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Parity bit,Gradient descent,Low-density parity-check code,Algorithm,Decoding methods,Mathematics,Offset (computer science) |
DocType | Volume | Citations |
Journal | abs/1503.08913 | 1 |
PageRank | References | Authors |
0.36 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tasnuva Tithi | 1 | 1 | 1.37 |
| Chris Winstead | 2 | 157 | 21.14 |
| Gopalakrishnan Sundararajan | 3 | 1 | 0.36 |