A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems
Xuepeng Wang, Baoming Bai, Xiao Ma
TL;DR
This paper introduces a low-complexity joint detection-decoding algorithm for nonbinary LDPC-coded modulation systems, combining message-passing and signal detection to improve efficiency and performance.
Contribution
The proposed algorithm offers a practical, low-complexity alternative to existing methods like QSPA, with fast convergence and good system performance.
Findings
Requires low computational complexity
Offers fast decoding convergence
Achieves good system performance
Abstract
In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an iterative manner. It requires low computational complexity, offers good system performance and has a fast rate of decoding convergence. Compared to the q-ary sum-product algorithm (QSPA), it provides an attractive candidate for practical applications of q-ary LDPC codes.
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.