{"title":"On the symmetric capacity of the K-user symmetric cyclic Gaussian interference channel","authors":"Lei Zhou, Wei Yu","doi":"10.1109/CISS.2010.5464891","DOIUrl":null,"url":null,"abstract":"The capacity region of Gaussian interference channel in the weak interference regime is an open problem. Recently, Etkin, Tse and Wang derived an outer bound for the two-user Gaussian interference channel and proved that a simple Han-Kobayashi signaling scheme can achieve within one bit of the capacity region for all values of channel parameters. In this paper, we extend their result to the K-user symmetric cyclic Gaussian interference channel. Our result shows that both the Etkin, Tse and Wang's upper bound and their one-bit achievability result on the symmetric rate continue to hold for the symmetric rate of the K-user symmetric cyclic channel using the same Han-Kobayashi strategy.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2010.5464891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
The capacity region of Gaussian interference channel in the weak interference regime is an open problem. Recently, Etkin, Tse and Wang derived an outer bound for the two-user Gaussian interference channel and proved that a simple Han-Kobayashi signaling scheme can achieve within one bit of the capacity region for all values of channel parameters. In this paper, we extend their result to the K-user symmetric cyclic Gaussian interference channel. Our result shows that both the Etkin, Tse and Wang's upper bound and their one-bit achievability result on the symmetric rate continue to hold for the symmetric rate of the K-user symmetric cyclic channel using the same Han-Kobayashi strategy.