Bubble check: a simplified algorithm for elementary check node processing in extended min-sum non-binary LDPC decoders

被引：45

作者：

Boutillon, E. ^{[1
]}

Conde-Canencia, L. ^{[1
]}

机构：

[1] Univ Europeenne Bretagne, UBS Lab STICC, CNRS, UMR Ctr Rech 3192, F-56321 Lorient, France

来源：

ELECTRONICS LETTERS | 2010年 / 46卷 / 09期

关键词：

CODES;

D O I：

10.1049/el.2010.0566

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A simplified algorithm for the check node processing of extended min-sum non-binary LDPC decoders is proposed. This novel technique, named bubble check, can reduce the number of compare operations by a factor of three at the elementary check node level. As this significant complexity reduction is achieved without any performance loss, this technique becomes highly attractive for hardware implementation.

引用

页码：633 / U51

页数：2

共 6 条

[1]

[Anonymous], P ICT MOB SUMM SANT

[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] Design of Regular (2, dc)-LDPC Codes over GF(q) Using Their Binary Images [J].

Poulliat, Charly ;

Fossorier, Marc ;

Declercq, David .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (10) :1626-1635

[4]

SEVIN V, 2008, P INT S INF THEOR IS, P960

[5]

VOICILA A, 2007, P IEEE INT C COMM IC

[6] 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 →