Construction of LDPC codes over GF(q) with modified progressive edge growth  

作　　者：CHEN Xin , MEN Ai-dong, YANG Bo, QUAN Zi-yi School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China 

出　　处：《The Journal of China Universities of Posts and Telecommunications》2009年第5期103-106,113,共5页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (60672087)

摘　　要：A parity check matrix construction method for constructing a low-density parity-check （LDPC） codes over GF（q） （q〉2） based on the modified progressive edge growth （PEG） algorithm is introduced. First, the nonzero locations of the parity check matrix are selected using the PEG algorithm. Then the nonzero elements are defined by avoiding the definition of subcode. A proof is given to show the good minimum distance property of constructed GF（q）-LDPC codes. Simulations are also presented to illustrate the good error performance of the designed codes.A parity check matrix construction method for constructing a low-density parity-check （LDPC） codes over GF（q） （q〉2） based on the modified progressive edge growth （PEG） algorithm is introduced. First, the nonzero locations of the parity check matrix are selected using the PEG algorithm. Then the nonzero elements are defined by avoiding the definition of subcode. A proof is given to show the good minimum distance property of constructed GF（q）-LDPC codes. Simulations are also presented to illustrate the good error performance of the designed codes.

关 键 词：LDPC codes over GF（q） progressive edge growth large minimum distance 

分 类 号：TN911.2[电子电信—通信与信息系统]