i.i.d. mixed inputs and treating interference as noise are gDoF optimal for the symmetric Gaussian two-user interference channel

Alex Dytso, Daniela Tuninetti, N. Devroye
{"title":"i.i.d. mixed inputs and treating interference as noise are gDoF optimal for the symmetric Gaussian two-user interference channel","authors":"Alex Dytso, Daniela Tuninetti, N. Devroye","doi":"10.1109/ISIT.2015.7282749","DOIUrl":null,"url":null,"abstract":"While a multi-letter limiting expression of the capacity region of the two-user Gaussian interference channel is known, capacity is generally considered to be open as this is not computable. Other computable capacity outer bounds are known to be achievable to within 1/2 bit using Gaussian inputs and joint decoding in the simplified Han and Kobayashi (single-letter) achievable rate region. This work shows that the simple scheme known as “treating interference as noise” without time-sharing attains the capacity region outer bound of the symmetric Gaussian interference channel to within either a constant gap, or a gap of order O(log log(SNR)), for all parameter regimes. The scheme is therefore optimal in the generalized Degrees of Freedom (gDoF) region sense almost surely. The achievability is obtained by using i.i.d. mixed inputs (i.e., a superposition of discrete and Gaussian random variables) in the multi-letter capacity expression, where the optimal number of points in the discrete part of the inputs, as well as the optimal power split among the discrete and continuous parts of the inputs, are characterized in closed form. An important practical implication of this result is that the discrete part of the inputs behaves as a “common message” whose contribution can be removed from the channel output, even though joint decoding is not employed. Moreover, time-sharing may be mimicked by varying the number of points in the discrete part of the inputs.","PeriodicalId":272313,"journal":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2015.7282749","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

While a multi-letter limiting expression of the capacity region of the two-user Gaussian interference channel is known, capacity is generally considered to be open as this is not computable. Other computable capacity outer bounds are known to be achievable to within 1/2 bit using Gaussian inputs and joint decoding in the simplified Han and Kobayashi (single-letter) achievable rate region. This work shows that the simple scheme known as “treating interference as noise” without time-sharing attains the capacity region outer bound of the symmetric Gaussian interference channel to within either a constant gap, or a gap of order O(log log(SNR)), for all parameter regimes. The scheme is therefore optimal in the generalized Degrees of Freedom (gDoF) region sense almost surely. The achievability is obtained by using i.i.d. mixed inputs (i.e., a superposition of discrete and Gaussian random variables) in the multi-letter capacity expression, where the optimal number of points in the discrete part of the inputs, as well as the optimal power split among the discrete and continuous parts of the inputs, are characterized in closed form. An important practical implication of this result is that the discrete part of the inputs behaves as a “common message” whose contribution can be removed from the channel output, even though joint decoding is not employed. Moreover, time-sharing may be mimicked by varying the number of points in the discrete part of the inputs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
对于对称高斯双用户干扰信道,i.i.d混合输入和将干扰作为噪声处理的gof最优
虽然双用户高斯干扰信道容量区域的多字母极限表达式是已知的,但容量通常被认为是开放的,因为这是不可计算的。已知其他可计算容量的外部边界可以在1/2位内实现,使用高斯输入和简化Han和Kobayashi(单字母)可实现速率区域的联合解码。这项工作表明,在没有时间分配的情况下,被称为“将干扰视为噪声”的简单方案可以使对称高斯干扰信道的容量区域外界在一个常数间隙内,或者在一个O阶(log log(SNR))的间隙内。因此,该方案在广义自由度(gdf)区域意义上几乎肯定是最优的。通过在多字母容量表达式中使用i.i.d混合输入(即离散随机变量和高斯随机变量的叠加)来获得可实现性,其中输入离散部分的最优点数以及输入离散部分和连续部分之间的最优功率分割以封闭形式表征。该结果的一个重要实际含义是,输入的离散部分表现为“公共消息”,其贡献可以从通道输出中删除,即使不采用联合解码。此外,可以通过改变输入的离散部分中的点的数目来模拟分时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
Portrayal of autism in mainstream media – a scoping review about representation, stigmatisation and effects on consumers in non-fiction and fiction media
IF 2.8 3区 心理学Current PsychologyPub Date : 2023-07-22 DOI: 10.1007/s12144-023-04959-6
Gloria Mittmann, B. Schrank, Verena Steiner-Hofbauer
The Representation of Muslim Characters in Post 9/11 Fiction
IF 0 Arab World English Journal For Translation and Literary StudiesPub Date : 2019-02-15 DOI: 10.24093/AWEJTLS/VOL3NO1.8
S. Abderrazag, Ilhem Serir
Challenging Representations of Sámi Characters in Fiction for Young Readers
IF 0 BarnbokenPub Date : 2023-12-07 DOI: 10.14811/clr.v46.831
Annbritt Palo, Lena Manderstedt, Lydia Kokkola
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Locally recoverable codes on algebraic curves Weight distributions of non-binary multi-edge type LDPC code ensembles A geometric analysis of the AWGN channel with a (σ, ρ)-power constraint Converse and duality results for combinatorial source-channel coding in binary Hamming spaces Price of perfection: Limited prediction for streaming over erasure channels
×
引用
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