Accelerated Q-ary low-density parity-check codes decoding with message selection

X. H. Shen, Chung Ming Lau

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

Immediate generalization of Gallager's binary lowdensity parity-check (LDPC) codes gave birth to the LDPC codes over GF(q), which demonstrated error performance exceeding that of binary codes with compromised complexity. Various methods had been proposed for the decoder with an aim to simplifying the belief propagation algorithm. One of the algorithms was the "extended min-sum (EMS)" decoder which concerned only a limited number of incoming messages at the checks. In this paper, we propose a modification to further simplify the EMS decoder without sacrificing performance.
Original languageEnglish
Title of host publicationProceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
DOIs
Publication statusPublished - 1 Dec 2009
Event5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009 - Beijing, China
Duration: 24 Sep 200926 Sep 2009

Conference

Conference5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009
Country/TerritoryChina
CityBeijing
Period24/09/0926/09/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Software
  • Communication

Cite this