首页> 外文OA文献 >Maximizing Expected Achievable Rates for Block-Fading Buffer-Aided Relay Channels
【2h】

Maximizing Expected Achievable Rates for Block-Fading Buffer-Aided Relay Channels

机译:最大限度地降低块渐入缓冲辅助中继通道的预期可实现速率

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, the long-term average achievable rate over block-fading buffer-aided relay channels is maximized using a hybrid scheme that combines three essential transmission strategies, which are decode-and-forward, compress-and-forward, and direct transmission. The proposed hybrid scheme is dynamically adapted based on the channel state information. The integration and optimization of these three strategies provide a more generic and fundamental solution and give better achievable rates than the known schemes in the literature. Despite the large number of optimization variables, the proposed hybrid scheme can be optimized using simple closed-form formulas that are easy to apply in practical relay systems. This includes adjusting the transmission rate and compression when compress-and-forward is the selected strategy based on the channel conditions. Furthermore, in this paper, the hybrid scheme is applied to three different models of the Gaussian block-fading buffer-aided relay channels, depending on whether the relay is half or full duplex and whether the source and the relay have orthogonal or non-orthogonal channel access. Several numerical examples are provided to demonstrate the achievable rate results and compare them to the upper bounds of the ergodic capacity for each one of the three channel models under consideration.
机译:在本文中,使用结合了三种基本传输策略(解码和转发,压缩和转发以及直接传输)的混合方案,最大程度地利用了块衰落缓冲区辅助中继信道上的长期平均可实现速率。所提出的混合方案是基于信道状态信息而动态地适应的。与文献中的已知方案相比,这三种策略的集成和优化提供了更为通用和基本的解决方案,并提供了更好的可实现率。尽管存在大量优化变量,但可以使用易于在实际继电器系统中应用的简单封闭式公式来优化建议的混合方案。这包括在基于信道条件选择压缩和转发策略时调整传输速率和压缩。此外,在本文中,根据中继是半双工还是全双工以及源和中继是正交还是非​​正交的,将混合方案应用于高斯块衰落缓冲辅助中继信道的三种不同模型频道访问。提供了几个数值示例来说明可实现的速率结果,并将它们与所考虑的三个通道模型中的每个通道模型的遍历容量上限进行比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号