2008 IEEE International Symposium on Information Theory最新文献_第3页

Finite memory universal portfolios 有限记忆通用组合

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595219

A. Tavory, M. Feder

引用次数: 6

Classical capacity of averaged quantum channels 平均量子信道的经典容量

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4594953

I. Bjelakovic, H. Boche

引用次数: 2

DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks 多跳合作网络的DMT -第二部分:分层和多天线网络

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595356

K. Sreeram, B. Sasidharan, P. V. Kumar

{"title":"DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks","authors":"K. Sreeram, B. Sasidharan, P. V. Kumar","doi":"10.1109/ISIT.2008.4595356","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595356","url":null,"abstract":"We consider single-source, single-sink (SS-SS) multi-hop relay networks, with slow-fading Rayleigh links. This two-part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity imax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short- block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AF protocols are often sufficient to attain the best possible DMT.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128421362","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}

引用次数: 13

Computation of Moments in the Trellis 网格中矩的计算

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595441

A. Heim, V. Sidorenko, U. Sorger

引用次数: 0

Raptor codes based distributed storage algorithms for wireless sensor networks 基于Raptor代码的无线传感器网络分布式存储算法

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595350

S. A. Aly, Z. Kong, E. Soljanin

引用次数: 47

How much training and feedback are needed in MIMO broadcast channels? MIMO广播信道需要多少训练和反馈?

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595475

M. Kobayashi, G. Caire, N. Jindal

引用次数: 69

On the capacity of a class of MIMO channels subject to normed uncertainty 一类受归一不确定性约束的MIMO信道的容量

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595457

S. Loyka, C. Charalambous

{"title":"On the capacity of a class of MIMO channels subject to normed uncertainty","authors":"S. Loyka, C. Charalambous","doi":"10.1109/ISIT.2008.4595457","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595457","url":null,"abstract":"The compound capacity of uncertain MIMO channels is considered, when the channel is modeled by a class described by an induced norm constraint. Within this framework, two types of classes are investigated, namely, additive and multiplicative uncertainties subject to a spectral norm constraint, using partial channel state information at the transmitter side. The compound capacity is defined as a maxmin of the mutual information, corresponding to the capacity of the class, in which the minimization is done over the class of channels while the maximization is done over the transmit covariance. Closed form solutions for the compound capacity of the classes are obtained while several properties related to transmit and received eigenvectors are presented. It is also shown that capacity of the class of channels is equal to the worst-case channel capacity, while establishing a saddle-point property. Additionally, explicit closed-from solutions are given for the capacity-achieving Tx covariance matrix and the worst-case channel uncertainty. The effect of uncertainty is shown to be equivalent to an SNR loss which is proportional to the size of the uncertainty of the channel matrix measured by the spectral norm.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126696357","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}

引用次数: 5

On the ergodic capacity of MIMO Nakagami-fading channels MIMO中上衰落信道的遍历容量研究

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4594962

C. Zhong, Kai‐Kit Wong, Shi Jin

引用次数: 10

Outage probability of the MIMO Gaussian free-space optical channel with PPM 具有PPM的MIMO高斯自由空间光信道的中断概率

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595472

N. Letzepis, A. G. Fàbregas

引用次数: 25

Error exponents and test channel optimization for the Gaussian Wyner-Ziv problem 高斯Wyner-Ziv问题的误差指数和测试通道优化

2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595019

B. Kelly, A. Wagner, A. Vamvatsikos

引用次数: 8