J4 ›› 2013, Vol. 40 ›› Issue (2): 13-17+47.doi: 10.3969/j.issn.1001-2400.2013.02.003

• Original Articles • Previous Articles     Next Articles

Rate-compatible network LDPC codes

WANG Jingyi1,2;LI Ying1,2;SUN Yue1,2   

  1. (1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an  710071, China;
    2. State Key Lab. of Wireless Mobile Communications, China Academy of Telecommunication Technology, Beijing  100083, China)
  • Received:2012-06-09 Online:2013-04-20 Published:2013-05-22
  • Contact: WANG Jingyi E-mail:wangjy@stu.xidian.edu.cn

Abstract:

A rate-compatible puncturing algorithm for network LDPC codes is proposed to achieve the minimum error probability, and decoding error probability is derived. The algorithm for finding variable nodes to be deleted based on the tanner graph of network LDPC codes is proposed, which is aimed at minimizing the decoding error probability and optimizing the puncturing pattern. Simulation results illustrate that, at BER=10-4, the proposed rate-compatible network LDPC codes have a coding gain of about 0.4dB compared with the codes obtained via the existing punctured methods.

Key words: multi-access relay network, low-density parity-check(LDPC)codes, network LDPC code, rate-compatible, puncturing