{"title":"双用户高斯干涉信道的新和速率上界","authors":"R. Etkin","doi":"10.1109/ISIT.2009.5205991","DOIUrl":null,"url":null,"abstract":"A new upper bound for the sum-capacity of the two-user complex Gaussian interference channel is derived. The bound is based on genies that provide side information signals to the receivers. Various parameters are introduced to control the side information, which can be optimized to get the tightest possible bound. The new bound improves the performance of the best known bounds for sufficiently small cross-gains.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"New sum-rate upper bound for the two-user Gaussian interference channel\",\"authors\":\"R. Etkin\",\"doi\":\"10.1109/ISIT.2009.5205991\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new upper bound for the sum-capacity of the two-user complex Gaussian interference channel is derived. The bound is based on genies that provide side information signals to the receivers. Various parameters are introduced to control the side information, which can be optimized to get the tightest possible bound. The new bound improves the performance of the best known bounds for sufficiently small cross-gains.\",\"PeriodicalId\":412925,\"journal\":{\"name\":\"2009 IEEE International Symposium on Information Theory\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2009.5205991\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2009.5205991","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New sum-rate upper bound for the two-user Gaussian interference channel
A new upper bound for the sum-capacity of the two-user complex Gaussian interference channel is derived. The bound is based on genies that provide side information signals to the receivers. Various parameters are introduced to control the side information, which can be optimized to get the tightest possible bound. The new bound improves the performance of the best known bounds for sufficiently small cross-gains.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
