多用户干扰信道的新和速率容量结果

Reza Khosravi-Farsani
{"title":"多用户干扰信道的新和速率容量结果","authors":"Reza Khosravi-Farsani","doi":"10.1109/ISIT.2019.8849858","DOIUrl":null,"url":null,"abstract":"The Interference Channels (ICs) represent fundamental building blocks of many wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two users, are still very limited. One of the main difficulties in the analysis of these networks is how to establish useful capacity outer bounds for them. In this paper, novel techniques requiring subtle sequential applications of the Csiszar-Korner identity are developed to establish efficient single-letter outer bounds on the sum-rate capacity of interference networks. Then, by using the derived outer bounds, a full characterization of the sum-rate capacity is obtained for various multi-user ICs under specific conditions. Our capacity results hold for both discrete and Gaussian networks.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"41 1","pages":"1277-1281"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Sum-Rate Capacity Results for Multi-User Interference Channels\",\"authors\":\"Reza Khosravi-Farsani\",\"doi\":\"10.1109/ISIT.2019.8849858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Interference Channels (ICs) represent fundamental building blocks of many wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two users, are still very limited. One of the main difficulties in the analysis of these networks is how to establish useful capacity outer bounds for them. In this paper, novel techniques requiring subtle sequential applications of the Csiszar-Korner identity are developed to establish efficient single-letter outer bounds on the sum-rate capacity of interference networks. Then, by using the derived outer bounds, a full characterization of the sum-rate capacity is obtained for various multi-user ICs under specific conditions. Our capacity results hold for both discrete and Gaussian networks.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"41 1\",\"pages\":\"1277-1281\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2019.8849858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

干扰信道(ic)是许多无线通信网络的基本组成部分。尽管网络信息理论取得了相当大的进展,但集成电路的可用容量结果,特别是具有两个以上用户的集成电路,仍然非常有限。分析这些网络的主要困难之一是如何确定它们的有效容量边界。在本文中,需要微妙的顺序应用cisszar - korner恒等式的新技术被开发,以建立有效的单字母外边界的和速率容量的干扰网络。然后,利用导出的外边界,得到了在特定条件下各种多用户集成电路的和速率容量的完整表征。我们的容量结果适用于离散网络和高斯网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
New Sum-Rate Capacity Results for Multi-User Interference Channels
The Interference Channels (ICs) represent fundamental building blocks of many wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two users, are still very limited. One of the main difficulties in the analysis of these networks is how to establish useful capacity outer bounds for them. In this paper, novel techniques requiring subtle sequential applications of the Csiszar-Korner identity are developed to establish efficient single-letter outer bounds on the sum-rate capacity of interference networks. Then, by using the derived outer bounds, a full characterization of the sum-rate capacity is obtained for various multi-user ICs under specific conditions. Our capacity results hold for both discrete and Gaussian networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Gambling and Rényi Divergence Irregular Product Coded Computation for High-Dimensional Matrix Multiplication Error Exponents in Distributed Hypothesis Testing of Correlations Pareto Optimal Schemes in Coded Caching Constrained de Bruijn Codes and their Applications
×
引用
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