Volume 10 - Issue 2
Low complexity LDPC coded modulation with iterative demapping and decoding
Abstract
An improved decoding scheme for low-density parity-check coded modulation with iterative demapping and decoding is presented. The proposed method deletes the early detected variable nodes from the Tanner graph and the modulation constellation, thus the parity check matrix and the size of modulation constellation shrink iteration by iteration, which lead to the decrease of decoding complexity finally. Simulation results show that the proposed method can reduce the decoding complexity significantly while the corresponding performance loss is almost negligible.
Paper Details
PaperID: 84892884260
Author's Name: Dai, L.
Volume: Volume 10
Issues: Issue 2
Keywords: Coded modulation, Forced convergence, Low-density parity-check code
Year: 2014
Month: January
Pages: 473 - 480