学习衰落信道的成本有多高?

Erwin Riegler, Günther Koliander, Wei Yang, G. Durisi
{"title":"学习衰落信道的成本有多高?","authors":"Erwin Riegler, Günther Koliander, Wei Yang, G. Durisi","doi":"10.1109/BlackSeaCom.2013.6623374","DOIUrl":null,"url":null,"abstract":"Recent results in communication theory suggest that substantial throughput gains in wireless fading networks can be achieved by exploiting network coordination (e.g., CoMP, network MIMO, interference alignment). However, these results are often based on the simplifying assumption that each node in the network has perfect channel knowledge and ignore the channel-estimation overhead. In this tutorial paper, we take a fresh look at the problem of learning fading channels. By focusing on simple channel models, we will illustrate how to quantify rigorously the throughput loss due to channel-estimation overhead. Specifically, by exploiting that in the absence of a priori channel knowledge at the receiver, the noiseless received signal is a nonlinear function of the transmitted signals and the propagation channel, we will show how to unveil the geometric structure underlying the channel input output relation, and how to use this geometry to characterize capacity at high SNR. We will also demonstrate that this approach is useful to determine the largest rate achievable at finite SNR and finite blocklength.","PeriodicalId":170309,"journal":{"name":"2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"How costly is it to learn fading channels?\",\"authors\":\"Erwin Riegler, Günther Koliander, Wei Yang, G. Durisi\",\"doi\":\"10.1109/BlackSeaCom.2013.6623374\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent results in communication theory suggest that substantial throughput gains in wireless fading networks can be achieved by exploiting network coordination (e.g., CoMP, network MIMO, interference alignment). However, these results are often based on the simplifying assumption that each node in the network has perfect channel knowledge and ignore the channel-estimation overhead. In this tutorial paper, we take a fresh look at the problem of learning fading channels. By focusing on simple channel models, we will illustrate how to quantify rigorously the throughput loss due to channel-estimation overhead. Specifically, by exploiting that in the absence of a priori channel knowledge at the receiver, the noiseless received signal is a nonlinear function of the transmitted signals and the propagation channel, we will show how to unveil the geometric structure underlying the channel input output relation, and how to use this geometry to characterize capacity at high SNR. We will also demonstrate that this approach is useful to determine the largest rate achievable at finite SNR and finite blocklength.\",\"PeriodicalId\":170309,\"journal\":{\"name\":\"2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BlackSeaCom.2013.6623374\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BlackSeaCom.2013.6623374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

通信理论的最新结果表明,无线衰落网络中的大量吞吐量增益可以通过利用网络协调(例如,CoMP,网络MIMO,干扰对齐)来实现。然而,这些结果通常是基于简化的假设,即网络中的每个节点都具有完善的信道知识,而忽略了信道估计开销。在这篇教程中,我们重新审视了学习衰落信道的问题。通过关注简单的信道模型,我们将说明如何严格量化由于信道估计开销造成的吞吐量损失。具体来说,通过利用在接收机缺乏先验信道知识的情况下,接收到的无噪声信号是发射信号和传播信道的非线性函数,我们将展示如何揭示信道输入输出关系背后的几何结构,以及如何使用该几何结构来表征高信噪比下的容量。我们还将证明这种方法对于确定在有限信噪比和有限块长度下可实现的最大速率是有用的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
How costly is it to learn fading channels?
Recent results in communication theory suggest that substantial throughput gains in wireless fading networks can be achieved by exploiting network coordination (e.g., CoMP, network MIMO, interference alignment). However, these results are often based on the simplifying assumption that each node in the network has perfect channel knowledge and ignore the channel-estimation overhead. In this tutorial paper, we take a fresh look at the problem of learning fading channels. By focusing on simple channel models, we will illustrate how to quantify rigorously the throughput loss due to channel-estimation overhead. Specifically, by exploiting that in the absence of a priori channel knowledge at the receiver, the noiseless received signal is a nonlinear function of the transmitted signals and the propagation channel, we will show how to unveil the geometric structure underlying the channel input output relation, and how to use this geometry to characterize capacity at high SNR. We will also demonstrate that this approach is useful to determine the largest rate achievable at finite SNR and finite blocklength.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信