Low-Latency Reweighted Belief Propagation Decoding for LDPC Codes
Citations
Cites methods from "Low-Latency Reweighted Belief Propa..."
...Even though the LDPC codes are decoded with the standard sum-product algorithm other decoders such as [19] can also be used....
[...]
Cites methods from "Low-Latency Reweighted Belief Propa..."
...The proposed KA-IDD scheme and BP algorithms are inspired by the reweighted BP decoding algorithms in [27], [28], which exploit the graphical distributions of the Tanner graph, iterative processing and weight optimization....
[...]
...[27] upgraded the reweighted BP algorithm from pairwise graphs to hypergraphs and reduced the set of reweighted parameters to a constant, whereas Liu and de Lamare considered the use of two possible values in [28]....
[...]
Additional excerpts
...k=1 ak (i) ε+ κ (ck, ck) κ (x (i) ,ck) (27) This is an important result because it controls the growing network created by the algorithm [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73]....
[...]
References
11,592 citations
"Low-Latency Reweighted Belief Propa..." refers background in this paper
...I. INTRODUCTION LOW-DENSITY parity-check (LDPC) codes are recog-nized as a class of linear block codes which can achieve near-Shannon capacity with linear-time encoding and parallelizable decoding algorithms....
[...]
3,246 citations
"Low-Latency Reweighted Belief Propa..." refers background in this paper
...Finally, Section V concludes the paper....
[...]
...The advantages of LDPC codes arise from the sparse (low-density) paritycheck matrices which can be uniquely depicted by graphical representations, referred to as Tanner graphs [3]....
[...]
3,032 citations
498 citations
"Low-Latency Reweighted Belief Propa..." refers background in this paper
...Finally, Section V concludes the paper....
[...]
...Recently, Wymeersch et al. [5], [6] introduced the uniformly reweighted BP (URW-BP) algorithm which exploits BP’s distributed nature and reduces the factor appearance probability (FAP) in [4] to a constant value....
[...]
...Additionally, the BP algorithm is capable of producing the exact inference solutions if the graphical model is acyclic (i.e., a tree), while it does not guarantee to converge if the graph possesses short cycles which significantly deteriorate the overall performance [4]....
[...]
401 citations
"Low-Latency Reweighted Belief Propa..." refers background in this paper
...Specifically, check nodes having a large number of short cycles are more likely to form clusters of small cycles, which significantly obstruct the convergence of BP algorithm within limited iterations [7]....
[...]