Wave-like Decoding of Tail-biting Spatially Coupled LDPC Codes Through Iterative Demapping
Sebastian Cammerer, Laurent Schmalen, Vahid Aref, Stephan ten Brink

TL;DR
This paper explores how tail-biting SC-LDPC codes combined with iterative demapping can reduce rate loss and improve decoding thresholds for higher order modulation schemes like 16-QAM.
Contribution
It introduces a hybrid mapping approach that optimizes decoding thresholds with minimal complexity increase for tail-biting SC-LDPC codes.
Findings
Hybrid mapping improves decoding thresholds
Tail-biting codes reduce rate loss
Iterative demapping enhances performance
Abstract
For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction with iterative demapping of higher order modulation formats. Therefore, we examine the BP threshold of different coupled and uncoupled ensembles. A comparison between the decoding thresholds approximated by EXIT charts and the density evolution results of the coupled and uncoupled ensemble is given. We investigate the effect and potential of different labelings for such a set-up using per-bit EXIT curves, and exemplify the method for a 16-QAM system, e.g., using set partitioning labelings. A hybrid mapping is proposed, where different sub-blocks use different labelings in order to further optimize the decoding thresholds of tail-biting codes, while…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
See pages 1-last of ISTC2016final.pdf
