期刊文献+

EXIT图分析多进制LDPC码

EXIT charts for nonbinary LDPC codes
下载PDF
导出
摘要 多进制LDPC码是二进制LDPC码在有限域GF(q=2p)上的扩展,研究表明在相同帧长和码率下,多进制LDPC码相比二进制LDPC码具有更优异的性能。介绍了EXIT图的基本原理,分析了AWGN信道下多进制LDPC码的迭代收敛性,同时确定其门限值,为后续采用EXIT分析设计实际通信系统奠定理论基础。仿真结果表明,在同样的信通情况下,四进制规则的LDPC码的性能要优于二进制规则的LDPC码,同时也验证了EXIT图工具分析研究迭代性问题的优越性。 Non-binary low-density parity-check (LDPC) codes defined over the finite field GF( q = 2^p) are an extension of binary LDPC codes and have demonstrated improved performance over binary LDPC codes with the same fiame length and rate. This paper introduces the principle of extrinsic information transfer (EXIT) charts, analyzes the convergence behavior of non-binary LDPC codes on AWGN channel, and confirms the thresholds of non-binary LDPC codes, which provides the foundation for analysis and design of real communication system using EXIT tool in future work. Simulation result shows that the performance of quaternary LDPC codes is better than that of binary LDPC codes in the same channel, and validates the superiority of using EXIT chart for iterative research.
出处 《重庆邮电大学学报(自然科学版)》 2008年第5期538-541,共4页 Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
关键词 LDPC码 互信息 迭代译码 性能优化 low-density parity-check codes mutual information iterative decoding performance optimization
  • 相关文献

参考文献10

  • 1[1]GALLAGER R G.Low-Density Parity Chech Codes[J].IRE Trans.Info.Theory,1962,8(1):1-28.
  • 2[2]MACKAY D,NEAL R.Near Shannon limit performance of low density parity check codes[J].Electronics Letters,1996,32(18):1645-1661.
  • 3[3]DAVEY M C,MACKAY D.Low-density parity-check codes over GF(q)[J].IEEE Commun.Lett.,1998,6(2):165-167.
  • 4[4]DAVEY M C.Error-correction using low-density paritycheck codes[EB/OL].[2006-03-01].http://www.inference.phy.cam.ac.uk/mcdavey/papers/davey_phd,html.
  • 5[5]LI G,FAIR I J,KRZYMIE'N W A.Low density parity check codes for space-time wireless transmission[J].in Proc.Intl.Conference on Wireless Communications,Calgary,Canada,2006,5(2):312-322.
  • 6[6]SONG H,CRUZ J R.Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording[J].IEEE Trans.Magn.,2003,39(3):1081-1087.
  • 7[7]BRINK S T.Convergence behavior of iteratively deeoded parallel concatenated codes[J].IEEE Transactions on Communications 2001,49(10):1727-1737.
  • 8[8]BENEDETTO S,DIVSALAR D,MONTORSI G,et al.Serial concatenation of interleaved eodes:Performance analysis,design and iterative decoding[J] IEEE Trans.Inform.Theory,1998,44(3):909-926.
  • 9[9]BRINK S T,KRAMER G,ASHIKHMIN A.Design of low-density parity-cheek codes for modulation and detection[J].IEEE Trans.Commun,2004,52(9):670-678.
  • 10黎勇,王琳,陈俊斌.基于PEG算法的多进制LDPC码的设计与仿真[J].重庆邮电学院学报(自然科学版),2006,18(2):175-177. 被引量:3

二级参考文献9

  • 1李祥明,SOLEYMANIM R,LODGE J,GUINAND P S.采用基于GF(q)的LDPC编码实现带宽有效传输及编码设计(英文)[J].重庆邮电学院学报(自然科学版),2005,17(2):138-143. 被引量:1
  • 2GALLAGER R G.Low-Density Parity Chech Codes[J].IRE Trans.Info.Theory,1962,IT-8(1):1-28.
  • 3MACKAY D J C,NEAL R M.Near Shannon limit performance of low densiy parity check codes[J].Electronics Letters,1996,32(8):1645-1646.
  • 4MACKAY D J C.Good error-correcting codes based on very sparse matrices[J].IEEE Trans.Inform.Theory.1999,45(2):399-431.
  • 5CHUNG S Y,FORNEY G D,RICHARDSON T J,et al.On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit[J].IEEE Commun.Lett.,2001,5(2):58-60.
  • 6HU X Y,ELEFTHERIOU E,ARNOLD D M.Progressive edge-growth Tanner graphs[EB/OL].(2001-12-18)[ 2005-02-27 ].http://ieeexplore.ieee.org/ie15/7633/20833/00965567.pdf.
  • 7DAVEY M,MACKAY D J C.Low-Density Parity Check Codes over GF(q)[J].IEEE Commun.Lett.,1998,2(6):165-167.
  • 8SONG Hong-xin,CRUZ J R.Reduced-complexity Decoding of q-ary LDPC Codes for Magnetic Recording[J ].IEEE Trans.Mang.,2003,39(3):1081-1087.
  • 9RICHARDSON T,URBANKE R.The capacity of low-density parity check codes under message-passing decoding[J ].IEEE Transactions on Information Theory,2001,47(2):599-618.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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