期刊文献+

码率自适应LDPC码删余算法 被引量:4

Puncturing Algorithm for Design Rate-Compatible LDPC Code
下载PDF
导出
摘要 鉴于无线通信信道的时变特性,信道纠错编码必须具备码率自适应的功能.现有的分组拣选算法尽管能构造出性能优秀的码率自适应删余型LDPC码,但达到的最高删余码率受到限制.对此,该文提出一种新的删余算法-分层拣选算法,解决了最高删余码率受限的问题,使码率能够无限接近1,且适用于任意LDPC码.AWGN信道下的仿真结果表明,所提出的算法较分组拣选算法具有更好的性能. Rate compatibility of forward error correction codes is required to accomplish high throughput and reliability over time-varying wireless channels.The grouping and sorting(GS) algorithm can produce rate-compatible puncturing LDPC(RCP-LDPC) codes with good performance.However,there is a limit in the achievable highest puncturing rate.In this paper,a novel layer-by-layer sorting algorithm is proposed to design RCP-LDPC without any limitation in the highest puncturing rate.The algorithm can be applied to an arbitrary LDPC code to obtain a code rate infinitely close to one.Simulation over AWGN channels shows that the proposed algorithm has superior performance as compared to the GS algorithm.
出处 《应用科学学报》 EI CAS CSCD 北大核心 2011年第4期385-389,共5页 Journal of Applied Sciences
基金 国家自然科学基金(No.60972053) 福建省自然科学基金(No 2008J0035)资助
关键词 码率自适应 LDPC码 删余 分组拣选 分层拣选 rate-compatible low density parity check(LDPC) codes puncturing grouping and sorting sorting layer by layer
  • 相关文献

参考文献12

  • 1GALLAGER R G. Low-density parity check codes [M]. Cambridge, MA: MIT Press, 1963.
  • 2MACKAY D J C, NEAL R M. Near Shannon limit performance of low density parity check codes [J]. Electronics Letters, 1997, 33(6): 457-458.
  • 3HA J, KIM J, MCLAUGHLIN S W. Rate-compatible puncturing of low-density parity-check codes [J]. IEEE Transactions on Information Theory, 2004, 50(11): 2824-2836.
  • 4RICHTER G, STIGLMAYR S, BOSSERT M. Optimized asymptotic puncturing distributions for different LDPC code constructions [C]//IEEE Int. Symp. Information Theory, Seattle, Washington, USA, 2006: 831-835.
  • 5TIAN T, JONES C, VILLASENOR J D. Rate-compatible low-density parity-check codes [C]//IEEE International Symposium on Information Theory, Chicago, USA, 2004: 153.
  • 6HA J, KIM J, KLINC D, MCLAUGHLIN S W. Ratecompatible punctured low-density parity-check codes with short block lengths [J]. IEEE Transactions on Information Theory, 2006, 52(2): 728-738.
  • 7VELLAMB! B N, FEKRI F. Finite-length ratecompatible LDPC codes: a novel puncturing scheme [J]. IEEE Transactions on Communications, 2009, 57(2): 297-301.
  • 8YUE G, WANG X, MADIHIAN M. Design of ratecompatible irregular repeat accumulate codes [J]. IEEE Transactions on Communications, 2007, 55(6): 1153-1163.
  • 9KIM J, RAMAMOORTHY A, MCLAUGHLIN S W. Design of efficiently-encodable rate-compatible irregular LDPC codes [J]. IEEE Transactions on Communications, 2009.
  • 10SHI C, RAMAMOORTHY A. Design and analysis of E2RC codes [J]. IEEE Journal on Selected Areas in Communications, 2009, 27(6): 889-898.

同被引文献33

  • 1GALLAGER R G. Low-density parity check codes [ M ]. Cambridge, MA: MIT Press, 1963.
  • 2THORPE J. Low-density parity-check ( LDPC ) codes constructed from protographs [ C ]//Tech. Rep. Progress Report. Pasadena, CA, USA : JPL IPN, 2003 : 42-154.
  • 3DIVSALAR D, JONES C, THORPE J. Protograph based LDPC codes with minimum distance linearly growing with block size [ C ] HIEEE. IEEE Communications Society subject. ST,louis: IEEE Globecom, 2005: 1152-1156.
  • 4HA J, KIM J, KLINC D, et al. Rate-compatible punc- tured low-density parity-check codes with short block length [ J ]. IEEE Trans Inform Theroy, 2006, 52 ( 2 ) : 728-738.
  • 5YOU Ying, XIAO Min, WANG Lin. The rate-compatible Multi-Edge Type LDPC codes with short block length [ C]//IEEE. Proceedings of the 5th International Confer- ence on Wireless communications ( WiCOM' 09 ). NJ, USA : IEEE Press, 2009 : 1-4.
  • 6LI J, NARAYANNA K. Rate-compatible low density par- ity check codes for capacity-approaching ARQ scheme in packet data communications [ C ]//Proc. Int Conf Comm Internet and Info. Tech (CIIT). Virgin Islands, USA: 2002:201-206.
  • 7MOSTAFA E1-Khamy, HOU Ji-lei, BHUSHAN Naga. Design of rate-compatible structured LDPC codes for Hy- brid ARQ application [ J ]. IEEE J Sele Areas Commun, 2009, 27(6):965-973.
  • 8ABBASFAR A, DIVSALAR D, YAO Kung. Accumulate repeat accumulate codes [ C ]// IEEE International Sym- posium on Information Theory (ISIT). Chicago, USA: IEEE Globecom, 2004:509-513.
  • 9DIVSALAR D. Ensemble weight enumerators for proto- graph LDPC codes [ C]//IEEE. IEEE International Sym- posium on Information Theory (ISIT). Seattle, Washing- ton, USA: IEEE Press, 2006 : 1554-1558.
  • 10DIVSALAR D, DOLINAR S, JONS C R, et al. Capaci- ty-approaching protograph codes [ J ]. IEEE J sele Areas Commun,2009, 27(6) : 876-888.

引证文献4

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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