期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Construction of LDPC codes over GF(q) with modified progressive edge growth 被引量：1

Construction of LDPC codes over GF(q) with modified progressive edge growth
原文传递
导出
摘要 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.
作者 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》 EI CSCD 2009年第5期103-106,113,共5页 中国邮电高校学报（英文版）
基金 supported by the National Natural Science Foundation of China (60672087)
关键词 LDPC codes over GF（q） progressive edge growth large minimum distance LDPC codes over GF（q）, progressive edge growth, large minimum distance
分类号 TN911.2 [电子电信—通信与信息系统]
  • 相关文献

参考文献11

  • 1Gallager R G. Low density parity check codes. IRE Transactions on Inform Theory, 1962, 8(1): 21-28.
  • 2Mackay D J C, Neal R M. Near Shannon limit performance of low density parity check codes. Electronics Letters, 1996, 32(18): 1645-1646.
  • 3Davey M C, Mackay D. Low-density parity-check codes over GF(q). IEEE Communications Letters, 1998, 2(6): 165-167.
  • 4Hu X Y, Eleftheriou E, Arnold D M. Regular and irregular progressive edge-growth Tanner graphs. IEEE Transactions on Information Theory, 2005, 51(1): 386-398.
  • 5Davey M C. Error-correction using low-density parity-check codes. Cambridge, UK: University of Cambridge, 1999.
  • 6Mackay D J C. Optimizing sparse graph codes over GF(q). Cambridge, UK: Cavendish Laboratory, 2003.
  • 7Kimura D, Guilloud F, P, yndiah R M. Construction of parity-check matrices for non-binary LDPC codes. Proceedings of the 4th International symposium on Turbo Codes and Related Topics, Apr 3-7, 2007, Munich, Germany. 2007.
  • 8Vardy A. The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory, 1997, 43(6): 1757-1766.
  • 9Tanner R M. Minimum-distance bounds by graph analysis. IEEE Transactions on Information Theory, 2001, 47(2): 808-821.
  • 10Mao Y Y, Banihashemi A H. A heuristic search for good low-density parity-check codes at short block lengths. Proceedings of IEEE International Conference on Communications(ICC'01): Vol 1, Jun 11-14, 2001, Helsinki, Finland. Piscataway, NJ, USA: IEEE, 2001:41-44.

同被引文献13

  • 1KOETTER R,VARDY A. Algebraic soft-decision deco- cling of Reed-Solomon codes [ J ]. IEEE Trans Inform Theory, 2003, 49 ( 11 ) :2809-2825.
  • 2JIANG J, NARAYANAN K. Algebraic soft-decislon de- coding of Reed-Solomon codes using bit-level soft infor- mation[ C ]//Proc Allerton Conference on Communica- tions, Control and Computing, Forty-Fourth Annual Alle- rton Conference, Allerton House, UIUC, Illinois, USA, Sept 27-29 2006. Allerton House, USA : [ s. n. ] , 2006 : 1261-1270.
  • 3BELLORADO J, KAVCIC A. A low-complexity method for Chase-type Decoding of Reed-Solomon Codes [ EB/ OL]. (2006-12-24) [ 2010-07-02 ].http://www-ee. eng. hawaii. edu/- alek/Archive/2007/C44. pdf.
  • 4GROSS W J,KSCHISCHANG F R, KOETTER R et al. A VLSI Architecture for Interpolation in soft-decision deco- ding of Reed-Solomon codes [ EB/OL ]. [ 2010-07-02 ]. http://www, comm. csl. uiuc. edu/- koetter/publica- tions/gross, pdf.
  • 5KOETTER R, VARDY A. A complexity reducing trans- formation in algebraic list decoding of Reed-Solomon codes[ C ]// Proc ITW, Paris, France, Mar. 2003. Par- is, France: [ s. n. ] ,2003 : 10-13.
  • 6ZHU Jiangli, ZHANG Xinmiao. Factorization-free Low- complexity Chase Soft-decision Decoding of Reed-Solo- mon codes[C]// Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on. Taipei, 24-27 May 2009. Taipei: IEEE Press, 2009:2677-2680.
  • 7ZHU Jiangli, ZHANG Xinmiao. Backward Interpolation Architecture for Algebraic Soft-Decision Reed-Solomon Decoding [ J ]. IEEE Transaction on VLSI, 2009, 17 (11) :1602-1615.
  • 8BELLORADO J, KAVCIC A. Low-complexity soft-deco- ding Algorithms for Reed-Solomon codes-part I: An Alge- braic Soft-In Hard-Out Chase Decoder[ J]. IEEE Trans-actions on information theory, 2010,56 (3) :945-959.
  • 9GROSS J, KSCHISCHANG R, KOETTER et al. Towards a VLSI Architecture for Interpolation-Based Soft-Decision Reed-Solomon Decoders[ J]. Journal of VLSI Signal Pro- cessing, 2005, 39(3): 93-111.
  • 10LEE Soo-Woong, KUMAR B V K Vijaya. Application of Soft-Decision Decoders to Non Narrow-Sense Reed-Solo- mon Codes [ C ]// IEEE Communication Society subject matter experts for publication in the ICC 2007 proceed- ings, 24-28 June 2007. Glasgow: IEEE Press, 2007: 6226-6230.

引证文献1

二级引证文献1

The Journal of China Universities of Posts and Telecommunications
2009年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部