通信学报 ›› 2013, Vol. 34 ›› Issue (3): 134-140.doi: 10.3969/j.issn.1000-436x.2013.03.017

• 技术报告 • 上一篇    下一篇

半双工中继信道下联合LDPC码设计

陈紫强1,欧阳缮1,2,肖海林2,谢跃雷2   

  1. 1 西安电子科技大学 电子工程学院,陕西 西安 710071
    2 桂林电子科技大学 信息与通信学院,广西 桂林541004
  • 出版日期:2013-03-25 发布日期:2017-07-20
  • 基金资助:
    国家重点基础研究发展计划(“973”计划)基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;广西省自然科学重点基金资助项目;广西省自然科学基金资助项目;广西省自然科学基金资助项目;广西无线宽带通信与信号处理重点实验室2011年度主任基金资助项目;广西无线宽带通信与信号处理重点实验室2011年度主任基金资助项目

Jointed LDPC codes design for half-duplex relay channels

Zi-qiang CHEN1,Shan OUYANG1,2,Hai-lin XIAO2,Yue-lei XIE2   

  1. 1 School of Electronic Engineering, Xidian University, X n 710071, China
    2 School of Information and Communication, Guilin University of Electro ic Technology, Guilin 541004, China
  • Online:2013-03-25 Published:2017-07-20
  • Supported by:
    The National Basic Research Program of China(973 Program);The National Natural Science Foun-dation of China;The National Natural Science Foun-dation of China;The National Natural Science Foun-dation of China;The Natural Science Key Foundation of Guangxi Province;The Natural Science Foundation of Guangxi Province;The Natural Science Foundation of Guangxi Province;The Key Director Laboratory Fund of Guangxi Broadband Wireless Communication and Signal of 2011;The Key Director Laboratory Fund of Guangxi Broadband Wireless Communication and Signal of 2011

摘要:

为了提高解码前传半双工中继通信系统的编码增益,提出了一种联合LDPC码编码结构及其度分布优化方法。该结构视信源和中继子码为联合LDPC码的一部分,目的端根据从信源和中继接收的消息进行联合译码,同时获得信源和中继的信息。为了分析联合LDPC码的渐进性能,推导了AWGN信道下联合LDPC码的高斯近似密度进化算法。结合译码收敛条件和度分布约束关系,提出联合LDPC码的度分布优化问题。仿真结果表明:联合LDPC码的渐进性能及误码性能优于BE-LDPC码和独立处理(SP)码。

关键词: 低密度奇偶校验码, 解码前传, 中继信道, 密度进化

Abstract:

In order to increase the coding gain of decode-and-forward half-duplex relay channel, a jointed LDPC coding structure and its corresponding optimization scheme was proposed. Novel structure made the subcodes of both source and relay nodes as parts of the overall code. Using the messages from the source and the relay, the destination could decode the information of the source and relay nodes simultaneously. To analyze the asymptotic coding gain of jointed LDPC codes, the iterative decoding convergence condition was derived in AWGN channel. Combining the iterative decoding convergence condition and the degree distribution constraint, the optimization problem of the jointed LDPC code degree distribution was presented. The simulation results show that jointed LDPC codes outperform both BE-LDPC codes and SP codes.

Key words: LDPC codes, decode-and-forward, relay channel, density evolution

No Suggested Reading articles found!