A low-complexity joint detection-decoding algorithm for nonbinary LDPC-coded modulation systems

Author

Wang, Xuepeng ; Bai, Baoming ; Ma, Xiao

Author_Institution

State Key Lab. of ISN, Xidian Univ., Xi´´an, China

fYear

2010

fDate

13-18 June 2010

Firstpage

794

Lastpage

798

Abstract

In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC coded-modulation 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.

Keywords

computational complexity; decoding; message passing; modulation coding; parity check codes; computational complexity; hard-decision decoding; low-complexity joint detection-decoding algorithm; message-passing strategy; nonbinary LDPC-coded modulation systems; q-ary sum-product algorithm; signal detector; Computational complexity; Convergence; Detectors; Iterative algorithms; Iterative decoding; Modulation coding; Parity check codes; Signal detection; Sum product algorithm; System performance;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on

Conference_Location

Austin, TX

Print_ISBN

978-1-4244-7890-3

Electronic_ISBN

978-1-4244-7891-0

Type

conf

DOI

10.1109/ISIT.2010.5513632

Filename

5513632