Low-complexity decoding of LDPC codes

被引：9

作者：

Pandya, N. ^{[1
]}

Honary, B. ^{[1
]}

机构：

[1] Univ Lancaster, Dept Commun & Syst, Infolab21, Lancaster LA1 4WA, England

来源：

ELECTRONICS LETTERS | 2007年 / 43卷 / 18期

基金：

英国工程与自然科学研究理事会;

关键词：

D O I：

10.1049/el:20071653

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity-check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented here, to improve the performance of the algorithm.

引用

页码：990 / 991

页数：2

共 7 条

[1] Reduced-complexity decoding of LDPC codes [J].

Chen, JH ;

Dholakia, A ;

Eleftheriou, E ;

Fossorier, MRC ;

Hu, XY .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (08) :1288-1299

[2] Density evolution for two improved BP-based decoding algorithms of LDPC codes [J].

Chen, JH ;

Fossorier, MPC .

IEEE COMMUNICATIONS LETTERS, 2002, 6 (05) :208-210

[3] Reduced complexity iterative decoding of low-density parity check codes based on belief propagation [J].

Fossorier, MPC ;

Mihaljevic, M ;

Imai, H .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (05) :673-680

[4]

Gallager RG, 1963, LOW DENSITY PARITY C

[5] Good error-correcting codes based on very sparse matrices [J].

MacKay, DJC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431

[6] Density evolution for low-density parity-check codes under Max-Log-MAP decoding [J].

Wei, X ;

Akansu, AN .

ELECTRONICS LETTERS, 2001, 37 (18) :1125-1126

[7]

Zarkeshvari F, 2002, GLOB TELECOMM CONF, P1349

← 1 →