计算机科学 ›› 2013, Vol. 40 ›› Issue (Z11): 29-31.
牛和昊,何元智
NIU He-hao and HE Yuan-zhi
摘要: 提出一种AWGN信道下有限长度RC-LDPC码的删余算法,该算法对规则及非规则LDPC码均有效。该删余算法基于一系列准则,其中一个重要准则是某个候选删除节点的具有低的近似环外消息度(ACE)的短环的数量。仿真结果表明,ACE对删余码的性能有很大的影响,该算法的性能比已有算法有进一步提高。
[1] Ha J,Kim J,McLaughlin S W.Rate-compatible puncturing oflow-density parity-check codes[J].IEEE Trans.Information Theory,2004,0(11):2824-2836 [2] Ha J,Kim J,Klinc D,et al.Rate-compatible punctured low-density parity-check codes with short block lengths[J].IEEE Trans.Information Theory,2006,2(2):728-738 [3] Park H Y,Kim K S,Whang K C.Efficient puncturing method for rate-compatible low-density parity-check codes[J].IEEE Trans.Wireless Comm,2007,6(11):3914-3919 [4] Vellambi B N,Fekri F.Finite length rate-compatible LDPCcodes:a novel puncturing scheme[J].IEEE Trans.Comm,2009,7(2):297-301 [5] El-khamy M,Hou J,Bhushan N.Design of rate-compatiblepunctured LDPC codes for hybrid ARQ applications[J].IEEE J.Sel.Areas Comm,2009,6(10):965-973 [6] Saeedi H,Banihashemi A H.Successive maximization for thesystematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels[J].IEEE Trans.Comm,2011,9(11):1807-1819 [7] Tian T,Jones C,Villasenor J D,et al.Selective avoidance of cycles in irregular LDPC code construction[J].IEEE Trans.Comm,2004,2(10):1242-1248 [8] Hu Y,Eleftheriou E,Arnold D M.Regular and irregular progressive edge growth Tanner graphs[J].IEEE Trans.Information Theory,2005,1(6):386-398 |
No related articles found! |
|