Design of Regular (2, dc)-LDPC Codes over GF(q) Using Their Binary Images

被引：211
作者：
Poulliat, Charly [1 ]
Fossorier, Marc [2 ]
Declercq, David [1 ]
机构：
[1] ENSEA UCP CNRS, ETIS, F-95014 Cergy Pontoise, France
[2] Univ Hawaii Manoa, Dept Elect Engn, Honolulu, HI 96822 USA
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 2008年 / 56卷 / 10期
关键词：
Channel coding; error correction coding; non-binary LDPC codes; iterative decoding; binary image;
D O I：
10.1109/TCOMM.2008.060527
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this paper, a method to design regular (2, d(c))-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of their binary image. First, the algebraic properties of rows of the parity check matrix H associated with a code are characterized and optimized to improve the waterfall. Then the algebraic properties of cycles and stopping sets associated with the underlying Tanner graph are studied and linked to the global binary minimum distance of the code. Finally, simulations are presented to illustrate the excellent performance of the designed codes.
引用
收藏
页码：1626 / 1635
页数：10
相关论文
共 21 条
[1]  
[Anonymous], 1999, THESIS U CAMBRIDGE
[2]  
BARNAULT L, 2003, P IEEE INF TH WORKSH
[3]   AN UPDATED TABLE OF MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES [J].
BROUWER, AE ;
VERHOEFF, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) :662-677
[4]   Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation [J].
Chung, SY ;
Richardson, TJ ;
Urbanke, RL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :657-670
[5]   Low-Density Parity Check Codes over GF (q) [J].
Davey, Matthew C. ;
MacKay, David .
IEEE COMMUNICATIONS LETTERS, 1998, 2 (06) :165-167
[6]  
DECLERCQ D, IEEE T COMMMUN UNPUB
[7]  
Di CY, 2002, IEEE T INFORM THEORY, V48, P1570, DOI 10.1109/TIT.2002.1003839
[8]  
Divsalar D, 2005, GLOB TELECOMM CONF, P1152
[9]   LOW-DENSITY PARITY-CHECK CODES [J].
GALLAGER, RG .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&
[10]   Regular and irregular progressive edge-growth tanner graphs [J].
Hu, XY ;
Eleftheriou, E ;
Arnold, DM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398
123