...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
【24h】

On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

机译：关于半双工协作信道中可实现的分集复用权衡

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up-link) channels. The proposed protocols are evaluated using Zheng-Tse diversity-multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound on the achievable diversity-multiplexing tradeoff with a single relay. We then construct a new AF protocol that achieves this upper bound. The proposed algorithm is then extended to the general case with (N-1) relays where it is shown to outperform the space-time coded protocol of Laneman and Wornell without requiring decoding/encoding at the relays. For the class of DF protocols, we develop a dynamic decode and forward (DDF) protocol that achieves the optimal tradeoff for multiplexing gains 0/spl les/r/spl les/1/N. Furthermore, with a single relay, the DDF protocol is shown to dominate the class of AF protocols for all multiplexing gains. The superiority of the DDF protocol is shown to be more significant in the cooperative broadcast channel. The situation is reversed in the CMA channel where we propose a new AF protocol that achieves the optimal tradeoff for all multiplexing gains. A distinguishing feature of the proposed protocols in the three scenarios is that they do not rely on orthogonal subspaces, allowing for a more efficient use of resources. In fact, using our results one can argue that the suboptimality of previously proposed protocols stems from their use of orthogonal subspaces rather than the half-duplex constraint.
机译：我们提出了由N个（半双工和单天线）伙伴和一个小区站点组成的延迟受限相干衰落信道的新型协作传输协议。在我们的工作中，我们区分中继，协作广播（下行链路）和协作多址（CMA）（上行链路）信道。拟议的协议使用正则分集复用权衡进行评估。对于中继通道，我们研究了两类合作方案：即，放大和转发（AF）协议以及解码和转发（DF）协议。对于第一类，我们使用单个中继在可实现的分集复用权衡上建立上限。然后，我们构造一个新的AF协议以达到此上限。然后将所提出的算法扩展到具有（N-1）个中继的一般情况，在该情况下，该算法表现出优于Laneman和Wornell的时空编码协议，而无需在中继上进行解码/编码。对于DF协议类别，我们开发了一种动态解码和转发（DDF）协议，该协议实现了复用增益0 / spl les / r / spl les / 1 / N的最佳折衷。此外，对于单个中继，对于所有多路复用增益，DDF协议显示出在AF协议类别中占主导地位。在协作广播频道中，DDF协议的优越性被证明更为重要。这种情况在CMA通道中得到了扭转，我们在该通道中提出了一种新的AF协议，该协议可以为所有复用增益实现最佳折衷。在这三种情况下，所提议协议的一个显着特征是它们不依赖于正交子空间，从而可以更有效地利用资源。实际上，使用我们的结果可以证明，先前提出的协议的次优性源于对正交子空间的使用，而不是半双工约束。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号