.png){kind=icon}
.png){kind=icon}
Return
Adaptive Group Shuffled Decoding for LDPC Codes
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2017.2717405.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose new grouping methods for group shuffled (GS) decoding of both regular and irregular low-density parity check cods. These methods are applicable for the belief-propagation as well as the min-sum-based GS decoders. Integer-valued metrics for measuring the reliability of each tentative variable node (VN) decision and the associated likelihood of being corrected are developed. The metrics are used to determine the VN updating priority, so the grouping may vary in each iteration. We estimate the computation complexity needed to adaptively regroup VNs. Numerical results show that our GS algorithms improve the performance of some existing GS belief-propagation decoders.
Keywords:
LDPC codes
belief propagation
group shuffled decoding
adaptive decoding schedule
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W