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

Author

Shen, X.H. ; Lau, Francis C M

Author_Institution

Dept. of Electron. & Inf. Eng., Hong Kong Polytech. Univ., Hong Kong, China

Volume

14

Issue

5

fYear

2010

fDate

5/1/2010 12:00:00 AM

Firstpage

444

Lastpage

446

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.

Keywords

AWGN channels; decoding; parity check codes; sorting; Euclidean distance sorting; Q-ary LDPC decoder; additive white Gaussian noise channel; decoding complexity; error performance; extended min-sum decoding algorithm; low-density parity-check codes; AWGN channels; Acceleration; Additive white noise; Bipartite graph; Decoding; Error correction codes; Medical services; Modulation coding; Parity check codes; Sorting; Accelerated decoding, error correction coding, Euclidean-distance, q-ary LDPC codes, two-dimensional modulation;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2010.05.092493

Filename

5456060