Q-ary LDPC decoders with reduced complexity

X. H. Shen, Chung Ming Lau

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

Abstract

Q-ary low-density parity-check (LDPC) codes achieve exceptional error performance at the expense of computation simplicity. Solutions to accelerate the decoding process have become one of the focuses in literature. In this paper, a decoding method is proposed, based on the subcode concept, to speed up the dominant iterative process. The method leads to speed improvement with moderate error-performance penalty.
Original languageEnglish
Title of host publication15th International Conference on Advanced Communication Technology
Subtitle of host publicationSmart Services with Internet of Things!, ICACT 2013 - Proceeding
Pages941-946
Number of pages6
Publication statusPublished - 22 Apr 2013
Event15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013 - PyeongChang, Korea, Republic of
Duration: 27 Jan 201330 Jan 2013

Conference

Conference15th International Conference on Advanced Communication Technology: Smart Services with Internet of Things!, ICACT 2013
CountryKorea, Republic of
CityPyeongChang
Period27/01/1330/01/13

Keywords

  • Bit error rate
  • complexity
  • LDPC code
  • q-ary LDPC code
  • subcode

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this