Q-ary LDPC Decoder with Euclidean-Distance-Based Sorting Criterion

被引：2

作者：

Shen, X. H. ^{[1
]}

Lau, Francis C. M. ^{[1
]}

机构：

[1] Hong Kong Polytech Univ, Elect & Informat Engn Dept, Hong Kong, Hong Kong, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2010年 / 14卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Accelerated decoding; error correction coding; Euclidean-distance; q-ary LDPC codes; two-dimensional modulation; CODES;

D O I：

10.1109/LCOMM.2010.05.092493

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

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.

引用

页码：444 / 446

页数：3

共 4 条

[1] Low-Density Parity Check Codes over GF (q) [J].

Davey, Matthew C. ;

MacKay, David .

IEEE COMMUNICATIONS LETTERS, 1998, 2 (06) :165-167

[2] Decoding algorithms for nonbinary LDPC codes over GF(q) [J].

Declercq, David ;

Fossorier, Marc .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (04) :633-643

[3]

MacKay D.J.C., ENCY SPARSE GRAPH CO

[4] Log-domain decoding of LDPC codes over GF (q) [J].

Wymeersch, H ;

Steendam, H ;

Moeneclaey, M .

2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, :772-776

← 1 →