部分CSIR衰落信道最大编码速率的非渐近逆

Antonios Pitarokoilis, M. Skoglund
{"title":"部分CSIR衰落信道最大编码速率的非渐近逆","authors":"Antonios Pitarokoilis, M. Skoglund","doi":"10.1109/ICC40277.2020.9149248","DOIUrl":null,"url":null,"abstract":"The problem of communication in Rayleigh fading channels with estimated channel state information at the receiver (CSIR) is investigated. Based on a related hypothesis testing problem in the Neyman-Pearson formulation, a non-asymptotic– in the codeword block-length–converse on the maximal coding rate is derived. The bound summarizes succinctly the effect of various system parameters that include the length of channel coherence interval, the length of the training and data intervals and the power allocated to training and data transmission. The bound is also studied in the asymptotic–in the codeword blocklength–regime and a particularly simple, non-trivial upper bound on the ergodic capacity of Raleigh fading channels with estimated CSIR is obtained. Finally, a second-order asymptotic expansion of the non-asymptotic converse is provided, which can be very useful in the study of latency-constrained communication systems.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Non-Asymptotic Converse on the Maximal Coding Rate of Fading Channels with Partial CSIR\",\"authors\":\"Antonios Pitarokoilis, M. Skoglund\",\"doi\":\"10.1109/ICC40277.2020.9149248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of communication in Rayleigh fading channels with estimated channel state information at the receiver (CSIR) is investigated. Based on a related hypothesis testing problem in the Neyman-Pearson formulation, a non-asymptotic– in the codeword block-length–converse on the maximal coding rate is derived. The bound summarizes succinctly the effect of various system parameters that include the length of channel coherence interval, the length of the training and data intervals and the power allocated to training and data transmission. The bound is also studied in the asymptotic–in the codeword blocklength–regime and a particularly simple, non-trivial upper bound on the ergodic capacity of Raleigh fading channels with estimated CSIR is obtained. Finally, a second-order asymptotic expansion of the non-asymptotic converse is provided, which can be very useful in the study of latency-constrained communication systems.\",\"PeriodicalId\":106560,\"journal\":{\"name\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC40277.2020.9149248\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9149248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了接收端估计信道状态信息的瑞利衰落信道通信问题。基于Neyman-Pearson公式中的一个相关假设检验问题,导出了码字块长度逆在最大编码率上的非渐近性。该界简明地总结了各种系统参数的影响,包括信道相干间隔的长度、训练和数据间隔的长度以及分配给训练和数据传输的功率。本文还研究了码字块长度区间的渐近界,得到了具有估计CSIR的Raleigh衰落信道遍历容量的一个特别简单的非平凡的上界。最后给出了非渐近逆的二阶渐近展开式,该展开式在时延约束通信系统的研究中非常有用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Non-Asymptotic Converse on the Maximal Coding Rate of Fading Channels with Partial CSIR
The problem of communication in Rayleigh fading channels with estimated channel state information at the receiver (CSIR) is investigated. Based on a related hypothesis testing problem in the Neyman-Pearson formulation, a non-asymptotic– in the codeword block-length–converse on the maximal coding rate is derived. The bound summarizes succinctly the effect of various system parameters that include the length of channel coherence interval, the length of the training and data intervals and the power allocated to training and data transmission. The bound is also studied in the asymptotic–in the codeword blocklength–regime and a particularly simple, non-trivial upper bound on the ergodic capacity of Raleigh fading channels with estimated CSIR is obtained. Finally, a second-order asymptotic expansion of the non-asymptotic converse is provided, which can be very useful in the study of latency-constrained communication systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Full Duplex MIMO Digital Beamforming with Reduced Complexity AUXTX Analog Cancellation Cognitive Management and Control of Optical Networks in Dynamic Environments Offloading Media Traffic to Programmable Data Plane Switches Simultaneous Transmitting and Air Computing for High-Speed Point-to-Point Wireless Communication A YouTube Dataset with User-level Usage Data: Baseline Characteristics and Key Insights
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1