首页> 外文期刊>IEEE Transactions on Information Theory >Diversity-Multiplexing Tradeoff in Multiantenna Multirelay Networks: Improvements and Some Optimality Results
【24h】

Diversity-Multiplexing Tradeoff in Multiantenna Multirelay Networks: Improvements and Some Optimality Results

机译:多天线多中继网络中的分集复用折衷:改进和一些最优结果

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

摘要

This paper investigates the benefits of amplify-and-forward (AF) relaying in the setup of multiantenna wireless networks. For this purpose, random sequential (RS) relaying is studied. It is shown that random unitary matrix multiplication at the relay nodes empowers the RS scheme to achieve a better diversity-multiplexing tradeoff (DMT) as compared to the traditional AF relaying. First, the RS scheme is proved to achieve the optimum DMT for a multiantenna full-duplex single-relay two-hop network. Applying this result, a new achievable DMT is derived for the case of multiantenna half-duplex parallel relay network. Interestingly, it turns out that the DMT of the RS scheme is optimum for the case of multiantenna two parallel noninterfering half-duplex relays. Furthermore, random unitary matrix multiplication is shown to also improve the DMT of the nonorthogonal AF relaying scheme for the case of a multiantenna single relay channel. Finally, the general case of multiantenna full-duplex relay networks is studied. First, a new lower-bound is derived on its DMT using the RS scheme. Furthermore, maximum multiplexing gain of the network is also shown to be achievable by traditional amplify-forward relaying. The gain value is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes.
机译:本文研究了放大转发(AF)中继在多天线无线网络设置中的好处。为此,研究了随机顺序(RS)中继。结果表明,与传统的AF中继相比,中继节点处的随机unit矩阵乘法使RS方案能够实现更好的分集复用折衷(DMT)。首先,RS方案被证明可以为多天线全双工单中继两跳网络实现最佳DMT。应用该结果,针对多天线半双工并行中继网络的情况,得出了一种新的可实现的DMT。有趣的是,事实证明,对于多天线两个并行无干扰的半双工中继,RS方案的DMT是最佳的。此外,对于多天线单中继信道,随机unit矩阵乘法还可以改善非正交AF中继方案的DMT。最后,研究了多天线全双工中继网络的一般情况。首先,使用RS方案在其DMT上导出一个新的下界。此外,通过传统的放大转发中继也可以实现网络的最大复用增益。增益值等于网络基础图的最小顶点割集,可以根据网络节点数在多项式时间内计算得出。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号