A Low-Complexity Joint Detection-Decoding Algorithm for Nonbinary LDPC-Coded Modulation Systems
arXiv:1006.1024 · doi:10.1109/ISIT.2010.5513632
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.
5 pages, 8 figures, to be presented at the IEEE Symposium on Information Theory (ISIT 2010) in Austin, Texas, June 2010