Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28240
Title: Q-ary LDPC decoder with euclidean-distance-based sorting criterion
Authors: Shen, XH
Lau, FCM 
Keywords: Accelerated decoding
Error correction coding
Euclidean-distance
Q-ary LDPC codes
Two-dimensional modulation
Issue Date: 2010
Publisher: IEEE-Inst Electrical Electronics Engineers Inc
Source: IEEE communications letters, 2010, v. 14, no. 5, 5456060, p. 444-446 How to cite?
Journal: IEEE Communications Letters 
Abstract: 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.
URI: http://hdl.handle.net/10397/28240
DOI: 10.1109/LCOMM.2010.05.092493
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Aug 12, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Aug 12, 2017

Page view(s)

42
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.