基于信道分区的MIMO多跳信道的分布式空时码

Sheng Yang, J. Belfiore
{"title":"基于信道分区的MIMO多跳信道的分布式空时码","authors":"Sheng Yang, J. Belfiore","doi":"10.1109/ITWITWN.2007.4318050","DOIUrl":null,"url":null,"abstract":"Summary form only given. In this paper, we consider multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies that efficiently utilize the relays in such a way that the diversity is maximized. First, we focus on the amplify-and-forward (AF) strategy with which the relays simply scale the received signal and retransmit it. More specifically, we characterize the diversity-multiplexing tradeoff (DMT) of the AF scheme in a general multihop channel with arbitrary number of antennas and arbitrary number of hops. The DMT is derived in closed-form expression as a function of the number of antennas at each node: as a first step, we provide some basic results on the DMT of the general Rayleigh product channels. It turns out that these results have very simple and intuitive interpretation. Then, the results are applied to the AF multihop channels which is shown to be equivalent to the Rayleigh product channel, in the DMT sense. Then, we mitigate the diversity suboptimality of the AF scheme via two kinds of partitions of the multihop channel : serial and parallel partitions. The serial partition corresponds to the intermediate decoding scheme. By supposing the relaying nodes could have full antenna cooperation, we study the fundamental problem that is when and where to decode to avoid diversity degradation. This scheme has minimum coding delay. The parallel partition corresponds to the distributed space-time processing. We establish conditions for the parallel partition to achieve the maximum diversity of the multihop channels. The parallel partition being rate-deficient in general, we propose a flip-and-forward (FF) scheme that achieves both the maximum diversity gain and multiplexing gain. The FF scheme is based on the parallel partition and works in a completely distributed manner. Coding schemes for both relaying strategies are proposed as well.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Distributed (Space-Time) Codes for the MIMO Multihop Channel via Partitions of the Channel\",\"authors\":\"Sheng Yang, J. Belfiore\",\"doi\":\"10.1109/ITWITWN.2007.4318050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. In this paper, we consider multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies that efficiently utilize the relays in such a way that the diversity is maximized. First, we focus on the amplify-and-forward (AF) strategy with which the relays simply scale the received signal and retransmit it. More specifically, we characterize the diversity-multiplexing tradeoff (DMT) of the AF scheme in a general multihop channel with arbitrary number of antennas and arbitrary number of hops. The DMT is derived in closed-form expression as a function of the number of antennas at each node: as a first step, we provide some basic results on the DMT of the general Rayleigh product channels. It turns out that these results have very simple and intuitive interpretation. Then, the results are applied to the AF multihop channels which is shown to be equivalent to the Rayleigh product channel, in the DMT sense. Then, we mitigate the diversity suboptimality of the AF scheme via two kinds of partitions of the multihop channel : serial and parallel partitions. The serial partition corresponds to the intermediate decoding scheme. By supposing the relaying nodes could have full antenna cooperation, we study the fundamental problem that is when and where to decode to avoid diversity degradation. This scheme has minimum coding delay. The parallel partition corresponds to the distributed space-time processing. We establish conditions for the parallel partition to achieve the maximum diversity of the multihop channels. The parallel partition being rate-deficient in general, we propose a flip-and-forward (FF) scheme that achieves both the maximum diversity gain and multiplexing gain. The FF scheme is based on the parallel partition and works in a completely distributed manner. Coding schemes for both relaying strategies are proposed as well.\",\"PeriodicalId\":257392,\"journal\":{\"name\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWITWN.2007.4318050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWITWN.2007.4318050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

只提供摘要形式。本文考虑了多天线多跳中继信道,其中源信号通过连续的N个独立中继跳到达目的地。这项工作的主要关注点是设计继电器策略,有效地利用继电器,使多样性最大化。首先,我们将重点放在放大和转发(AF)策略上,通过该策略,继电器简单地缩放接收到的信号并重新发送它。更具体地说,我们描述了在具有任意数量天线和任意跳数的一般多跳信道中AF方案的分集-复用权衡(DMT)。DMT以每个节点天线数的函数的封闭形式导出:作为第一步,我们提供了一般瑞利产品信道的DMT的一些基本结果。事实证明,这些结果有非常简单和直观的解释。然后,将结果应用于自动对焦多跳信道,该信道在DMT意义上等同于瑞利积信道。然后,我们通过串行和并行两种多跳信道分区来减轻自动对调方案的分集次优性。串行分区对应于中间解码方案。假设中继节点具有充分的天线合作,研究了在何时何地进行解码以避免分集退化的基本问题。该方案具有最小的编码延迟。并行分区对应于分布式时空处理。建立了实现多跳信道最大分集的并行划分条件。在并行分块普遍存在速率不足的情况下,我们提出了一种同时实现最大分集增益和最大复用增益的翻转前向(FF)方案。FF方案基于并行分区,以完全分布式的方式工作。同时提出了两种中继策略的编码方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed (Space-Time) Codes for the MIMO Multihop Channel via Partitions of the Channel
Summary form only given. In this paper, we consider multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies that efficiently utilize the relays in such a way that the diversity is maximized. First, we focus on the amplify-and-forward (AF) strategy with which the relays simply scale the received signal and retransmit it. More specifically, we characterize the diversity-multiplexing tradeoff (DMT) of the AF scheme in a general multihop channel with arbitrary number of antennas and arbitrary number of hops. The DMT is derived in closed-form expression as a function of the number of antennas at each node: as a first step, we provide some basic results on the DMT of the general Rayleigh product channels. It turns out that these results have very simple and intuitive interpretation. Then, the results are applied to the AF multihop channels which is shown to be equivalent to the Rayleigh product channel, in the DMT sense. Then, we mitigate the diversity suboptimality of the AF scheme via two kinds of partitions of the multihop channel : serial and parallel partitions. The serial partition corresponds to the intermediate decoding scheme. By supposing the relaying nodes could have full antenna cooperation, we study the fundamental problem that is when and where to decode to avoid diversity degradation. This scheme has minimum coding delay. The parallel partition corresponds to the distributed space-time processing. We establish conditions for the parallel partition to achieve the maximum diversity of the multihop channels. The parallel partition being rate-deficient in general, we propose a flip-and-forward (FF) scheme that achieves both the maximum diversity gain and multiplexing gain. The FF scheme is based on the parallel partition and works in a completely distributed manner. Coding schemes for both relaying strategies are proposed as well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信