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

• 研究论文 • 上一篇    下一篇

适用于网络LDPC码的速率兼容算法

王静怡1,2;李颖1,2;孙岳1,2
  

  1. (1. 西安电子科技大学 综合业务网理论及关键技术国家重点实验室,陕西 西安  710071;
    2. 电信科学研究院 无线移动通信国家重点实验室,北京  100083)
  • 收稿日期:2012-06-09 出版日期:2013-04-20 发布日期:2013-05-22
  • 通讯作者: 王静怡
  • 作者简介:王静怡(1984-),女,西安电子科技大学博士研究生,E-mail: wangjy@stu.xidian.edu.cn.
  • 基金资助:

    国家自然基金资助项目(61072064);国家科技重大专项资助项目(2010ZX03003-003-03);长江学者和创新团队发展计划资助项目(IRT0852);中央高校科研业务费专项资金资助项目(K50510010026)

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

摘要:

提出了一种可以获得最小比特错误概率的网络低密度奇偶校验(LDPC)码速率兼容删余算法,并推导了该算法的译码错误概率.该算法基于网络LDPC码的结构特点,以达到译码最小比特错误概率为目标,在网络LDPC码的Tanner图上搜索出需要删余的变量节点,以获得最优的删余图样.仿真结果表明,该算法比现有算法在BER为10-4时有0.4dB的性能增益.

关键词: 多址接入中继网络, LDPC码, 网络LDPC码, 速率兼容, 删余

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