中国邮电高校学报(英文) ›› 2009, Vol. 16 ›› Issue (5): 103-106.doi: 10.1016/S1005-8885(08)60275-7

• Others • 上一篇    下一篇

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

陈昕,门爱东,杨波,全子一   

  1. School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • 收稿日期:2008-12-09 修回日期:1900-01-01 出版日期:2009-10-30
  • 通讯作者: 陈昕

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

CHEN Xin ,MEN Ai-dong, YANG Bo, QUAN Zi-yi   

  1. School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2008-12-09 Revised:1900-01-01 Online:2009-10-30
  • Contact: CHEN Xin

摘要:

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

Abstract:

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.

Key words:

LDPC codes over GF(q);progressive edge growth;large minimum distance