Parallel weighted bit-flipping decoding

被引：37

作者：

Wu, Xiaofu ^{[1
]}

Zhao, Chunming

You, Xiaohu

机构：

[1] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Peoples R China

[2] Nanjing Inst Commun Engn, Nanjing 210007, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2007年 / 11卷 / 08期

基金：

中国博士后科学基金; 中国国家自然科学基金;

关键词：

belief-propagation (BP); bit-flipping (BF) decoding; low-density parity-check (LDPC) codes; PARITY-CHECK CODES; LDPC CODES; ALGORITHM;

D O I：

10.1109/LCOMM.2007.070269

中图分类号：

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

学科分类号：

0809 ;

摘要：

A parallel weighted bit-flipping (PWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known serial weighted bit-flipping decoding, the PWBF decoding converges significantly faster but with little performance penalty. For decoding of finite-geometry LDPC codes, we demonstrate through examples that the proposed PWBF decoding converges in about 5 iterations with performance very close to that of the standard belief-propagation decoding.

引用

页码：671 / 673

页数：3

共 6 条

[1]

Jiang M, 2005, IEEE COMMUN LETT, V9, P814, DOI [10.1109/LCOMM.2005.1506712, 10.1109/LCOMM.2005.09008]

[2] Low-density parity-check codes based on finite geometries: A rediscovery and new results [J].

Kou, Y. (ykou@att.net), 2001, Institute of Electrical and Electronics Engineers Inc. (47)

[3] A decoding algorithm for finite-geometry LDPC codes [J].

Liu, ZY ;

Pados, DA .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (03) :415-421

[4] Expander codes [J].

Sipser, M ;

Spielman, DA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1710-1722

[5] Improving belief propagation on graphs with cycles [J].

Yazdani, MR ;

Hemati, S ;

Banihashemi, AH .

IEEE COMMUNICATIONS LETTERS, 2004, 8 (01) :57-59

[6] A modified weighted bit-flipping decoding of low-density parity-check codes [J].

Zhang, JT ;

Fossorier, MPC .

IEEE COMMUNICATIONS LETTERS, 2004, 8 (03) :165-167

← 1 →