...
首页> 外文期刊>Eurasip Journal on Wireless Communications and Networking >Jointly optimized rate-compatible UEP-LDPC codes for half-duplex co-operative relay networks
【24h】

Jointly optimized rate-compatible UEP-LDPC codes for half-duplex co-operative relay networks

机译:联合优化的速率兼容UEP-LDPC码,用于半双工协作中继网络

获取原文
   

获取外文期刊封面封底 >>

       

摘要

This paper addresses the design of low-density parity-check (LDPC) codes for half-duplex co-operative relay networks. Structured rate-compatible codes with unequal error protection (UEP) are designed through joint optimization of the codes for the channels between source and relay and source and destination. The proposed codes clearly outperform simpler LDPC codes which are not optimized for relay channels and puncturing-based rate-compatible LDPC codes, and they show a significant performance improvement over the direct link communication depending on the position of relay. The optimization algorithm for the proposed codes is based on density evolution using the Gaussian approximation and optimal variable node degree distributions are found through iterative linear programming. Interestingly, they anyhow show performance which is almost comparable to the performance of codes optimized through a more complex non-linear optimization algorithm. We analyze the performance of our proposed codes with short, medium and long block lengths, and with low and high rates under realistic assumptions, i.e., imperfect decoding of the codeword at relay and variant signal-to-noise ratio within a single codeword.
机译:本文介绍了用于半双工协作中继网络的低密度奇偶校验(LDPC)代码的设计。通过联合优化源和中继之间以及源和目标之间的通道的代码,设计了具有不等错误保护(UEP)的结构化速率兼容代码。提议的代码明显优于未针对中继信道和基于穿孔的速率兼容LDPC代码进行了优化的简单LDPC代码,并且根据中继的位置,它们在直接链路通信方面表现出显着的性能提升。所提出代码的优化算法基于使用高斯近似的密度演化,并通过迭代线性规划找到了最优的变量节点度分布。有趣的是,它们无论如何都显示出与通过更复杂的非线性优化算法优化后的代码的性能几乎可比的性能。我们在现实的假设下,即短,中和长块长度以及低和高速率下,对我们提出的代码的性能进行了分析,即在单个代码字内以中继和不同信噪比对代码字进行不完美的解码。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号