.png){kind=icon}
.png){kind=icon}
Return
A Multiple-Voting-Based Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2702196.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a multiple-voting-based joint detection-decoding algorithm for nonbinary low density parity-check (LDPC)-coded modulation systems. This algorithm is inspired from the reliability based JDD algorithm for nonbinary LDPC-coded modulation systems, that has been proposed recently, in which the accumulated reliability of symbols based on one-step majority-logic decoding algorithm and the Chase-like local list decoding algorithm are used. However, the reliability-based JDD algorithm still has a significant performance degradation of at least 1 dB with low column weight(d(v) <= 4). In order to reduce the performance degradation with low column weight, the proposed algorithm allows unfixed number of variable nodes to pass two symbols to the associated check node, in contrast with the reliability-based JDD algorithm, which allows only one variable node to pass two symbols to check node, when updating variable-to-check messages. Moreover, the votes are weighted differently according to the components of the list in the checksum computation. Simulations show that the proposed algorithm yields better performance with low column weight, while still maintaining the low complexity feature.
Keywords:
Joint detection-decoding algorithm
multiple-voting
nonbinary LDPC codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
View more organizations