首页> 外文会议>2013 Seventh International Conference on Complex, Intelligent, and Software Intensive Systems >Downlink Relay Selection Algorithm for Amplify-and-Forward Cooperative Communication Systems
【24h】

Downlink Relay Selection Algorithm for Amplify-and-Forward Cooperative Communication Systems

机译:放大转发协作通信系统的下行中继选择算法

获取原文
获取原文并翻译 | 示例

摘要

In wireless networks, the cooperative relaying that provides a spatial diversity and improves the performance of system is a tendency in the future communications. There are three strategies in the cooperative communications. One is Amplify-and-Forward (AF) mode. Another is Decode-and-Forward (DF) mode and the other is Compress and Forward (CF) mode. Comparing with these three kind modes, AF mode is with the low complexity to implement. Consider the Raleigh fading environment where there are one information source, M relay stations and N destinations. The downlink signal includes two parts. One is from the source and the other comes from the relay stations. In order to achieve the maximum throughput in the system, it should obtain the maximum mutual information between the source and the destination. Hence, how to select an optimal relay station is important in the cooperative communications. This project proposes a relay selection algorithm with Amplify-and-Forward mode employed. The optimal selection scheme is based on the exhaustive search method. It is easy to be realized with a high computational complexity. In order to reduce the computational complexity, the relay station selection scheme with a maximum mutual information finding is proposed. With different relay station selection schemes, the performances are given for comparison.
机译:在无线网络中,提供空间分集并改善系统性能的协作中继是未来通信的趋势。合作通信中有三种策略。一种是放大转发(AF)模式。另一个是解码和转发(DF)模式,另一个是压缩和转发(CF)模式。与这三种模式相比,AF模式实现起来具有较低的复杂性。考虑一个有一个信息源,M个中继站和N个目的地的罗利衰落环境。下行链路信号包括两个部分。一个来自源,另一个来自中继站。为了实现系统中的最大吞吐量,它应该获得源和目标之间的最大互信息。因此,如何选择最佳中继站在协作通信中很重要。该项目提出了一种采用放大转发模式的中继选择算法。最佳选择方案基于穷举搜索方法。容易以高计算复杂度实现。为了降低计算复杂度,提出了具有最大互信息发现的中继站选择方案。对于不同的中继站选择方案,给出了性能以进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号