{"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}
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.