An Improved Decoding Algorithm for Finite-Geometry LDPC Codes

被引:19
作者
Ngatched, Telex Magloire Nkouatchah [1 ]
Takawira, Fambirai [1 ]
Bossert, Martin [2 ]
机构
[1] Univ KwaZulu Natal, Sch Elect Elect & Comp Engn, ZA-4041 Durban, South Africa
[2] Univ Ulm, Dept Telecommun & Appl Informat Theory, D-89081 Ulm, Germany
关键词
Belief propagation algorithm; bit-flipping (BF); decoding algorithms; low-density parity-check (LDPC) codes; PARITY-CHECK CODES; BELIEF PROPAGATION;
D O I
10.1109/TCOMM.2009.02.060352
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this letter, an improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.
引用
收藏
页码:302 / 306
页数:5
相关论文
共 16 条
[1]  
[Anonymous], 1983, Error control coding
[2]  
[Anonymous], 1963, Low-Density Parity-Check Codes
[3]  
[Anonymous], PROBL PEREDA INF
[4]   Near optimum universal belief propagation based decoding of low-density parity check codes [J].
Chen, JH ;
Fossorier, MPC .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (03) :406-414
[5]   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
[7]   Factor graphs and the sum-product algorithm [J].
Kschischang, FR ;
Frey, BJ ;
Loeliger, HA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :498-519
[8]  
LIN Z, 2005, IEEE T COMMUN, V53, P415
[9]   Iterative decoding of one-step majority logic decodable codes based on belief propagation [J].
Lucas, R ;
Fossorier, MPC ;
Kou, Y ;
Lin, S .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2000, 48 (06) :931-937
[10]   Near Shannon limit performance of low density parity check codes [J].
MacKay, DJC ;
Neal, RM .
ELECTRONICS LETTERS, 1996, 32 (18) :1645-1646