Computer Science ›› 2013, Vol. 40 ›› Issue (Z11): 29-31.

Previous Articles     Next Articles

Rate-compatible Puncturing Algorithm for Finite-length LDPC Codes

NIU He-hao and HE Yuan-zhi   

  • Online:2018-11-16 Published:2018-11-16

Abstract: This paper propose a rate-compatible puncturing scheme for finite-length low-density parity-check (LDPC)codes over the additive white Gaussian noise (AWGN) channel.The method can applicable to both regular and irregular LDPC code.The scheme selects bits to be punctured base on a sequence of criteria.An important selection criterion is the number of short cycles with low approximate cycle extrinsic message degree (ACE) in which a candidate bit node participates.Simulation results demonstrate that the ACE plays an important role in the performance of the codes,these results also show that the scheme is superior to the existing puncturing methods in a wide range of code rates.

Key words: Low-density parity-check (LDPC) codes,Rate-compatible,Tanner graph,Puncturing,Finite-length,Approximate cycle extrinsic message degree (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!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!