.png){kind=icon}
Return
A Local Re-Decoding Algorithm for LDPC-Coded Modulation With CCDMs
.png){kind=icon}
PRE
AI
DOI：10.1109/LWC.2026.3651252.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter proposes to break trapping sets of the low-density parity-check (LDPC) codes used in an LDPC-coded modulation system that employs constant composition distribution matchers (CCDMs). By re-decoding a list of candidate input message vectors, obtained in terms of the double extension of unsatisfied check nodes (UCNs) or the weight constraint of CCDM codewords, the LDPC decoder may get out of the trapped state. As a result, the shaping decoder of CCDM may acquire more accurate input messages from the re-decoding process of LDPC code. Simulation results show that the proposed local re-decoding (LRD) algorithm can achieve better performance with reasonable computational overhead compared with other algorithms for decoding LDPC codes in the LDPC-coded modulation system.
Keywords:
LDPC codes
CCDMs
error-floor
trapping set
re-decoding
Journal
I
IF:
5.5
Papers:
705
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSave
On Construction of Low-Density Parity-Check Codes for Ultra-Reliable and Low Latency Communications
PREAI
ShareSaveShareSaveShareSave
View more