A Multiple-Voting-Based Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 5; s. 9739 - 9747
Hlavní autoři: Zhu, Min, Guo, Quan, Xu, Hengzhou, Bai, Baoming, Ma, Xiao
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithm design and analysis
Algorithms
Binary system
Codes
Complexity theory
Decoding
Error correcting codes
Iterative decoding
Joint detection-decoding algorithm
Modulation
multiple-voting
Nodes
nonbinary LDPC codes
Performance degradation
Reliability
Symbols
Voting
Weight
ISSN:2169-3536, 2169-3536
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 check-sum computation. Simulations show that the proposed algorithm yields better performance with low column weight, while still maintaining the low complexity feature.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2017.2702196