Q-ary LDPC decoder with euclidean-distance-based sorting criterion

X. H. Shen, Chung Ming Lau

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)


Q-ary low-density parity-check (LDPC) codes, compared with binary ones, produce a better error performance but with a higher decoding complexity. Various solutions, such as speeding up single operations or reducing the total number of operations, have been proposed for accelerating the decoding process. In this letter, we propose a modification to the extended min-sum (EMS) decoding algorithm. The aim is to improve the decoding speed without sacrificing any error performance over an additive white Gaussian noise (AWGN) channel environment.
Original languageEnglish
Article number5456060
Pages (from-to)444-446
Number of pages3
JournalIEEE Communications Letters
Issue number5
Publication statusPublished - 1 May 2010


  • Accelerated decoding
  • Error correction coding
  • Euclidean-distance
  • Q-ary LDPC codes
  • Two-dimensional modulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Modelling and Simulation


Dive into the research topics of 'Q-ary LDPC decoder with euclidean-distance-based sorting criterion'. Together they form a unique fingerprint.

Cite this