Low-Latency Reweighted Belief Propagation Decoding for LDPC Codes
Citations
1 citations
Additional excerpts
...schemes [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], [74], [75], [80], [77], [78], [79], [80], [81], [82], [83], [84], [85]....
[...]
1 citations
1 citations
1 citations
Cites background from "Low-Latency Reweighted Belief Propa..."
...The development of IDD schemes and decoding algorithms that perform message passing with reduced delays [60]–[62] are of great importance in massive MIMO systems....
[...]
...Therefore, we novel message passing algorithms with smarter strategies to exchange information should be investigated along with their application to IDD schemes [60]–[62]....
[...]
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]....
[...]