2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks最新文献_第5页

Distributed (Space-Time) Codes for the MIMO Multihop Channel via Partitions of the Channel 基于信道分区的MIMO多跳信道的分布式空时码

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318050

Sheng Yang, J. Belfiore

{"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":"https://doi.org/10.1109/ITWITWN.2007.4318050","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.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115545583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Multidimensional Walsh Transform and a Characterization of Bent Functions 多维沃尔什变换与弯曲函数的表征

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318037

K. Nyberg, Miia Hermelin

引用次数: 21

Actions of the Unitary Group on Irreducible/Primitive Polynomials and Their Applications to Randomness of Sequences 不可约/原始多项式上的酉群作用及其在序列随机性上的应用

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318055

S. Golomb, G. Gong

引用次数: 1

Binary Linear Network Codes 二进制线性网络码

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318068

Hsiao-feng Lu

引用次数: 7

Secrecy Capacity of Semi-deterministic Wire-tap Channels 半确定性窃听信道的保密能力

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318063

Jared Grubb, S. Vishwanath, Yingbin Liang, H. Poor

引用次数: 13

Constructing Optimal Division Algebras for Space-Time Coding 构造时空编码的最优除法代数

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318042

R. Vehkalahti

引用次数: 4

Low Complexity Two Stage Detection Scheme for MIMO Systems MIMO系统的低复杂度两级检测方案

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318062

M. Chouayakh, A. Knopp, B. Lankl

引用次数: 12

SER Expressions for Double Differential Modulation 双差分调制的SER表达式

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318064

M. Bhatnagar, A. Hjørungnes

引用次数: 28

Rank Distance Codes for ISI channels ISI信道的等级距离码

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318026

S. Dusad, S. Diggavi, A. R. Calierbank

引用次数: 2

Distributed Transmit Diversity in Relay Networks 中继网络中的分布式发射分集

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-05-24 DOI: 10.1109/ITWITWN.2007.4318070

C. Akçaba, Patrick Kuppinger, H. Bölcskei

引用次数: 3