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

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, offer...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 IEEE International Symposium on Information Theory s. 794 - 798
Hlavní autoři: Xuepeng Wang, Baoming Bai, Xiao Ma
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2010
Témata:
Computational complexity
Convergence
Detectors
Iterative algorithms
Iterative decoding
Modulation coding
Parity check codes
Signal detection
Sum product algorithm
System performance
ISBN:9781424478903, 1424478901
ISSN:2157-8095
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9781424478903
1424478901
ISSN:2157-8095
DOI:10.1109/ISIT.2010.5513632