{"title":"中继信道的新编码策略","authors":"Hon-Fah Chong, M. Motani, H. K. Garg","doi":"10.1109/ISIT.2005.1523507","DOIUrl":null,"url":null,"abstract":"This paper studies coding strategies for a three-node relay channel. We first review the basic coding strategies of Cover and El Gamal for the relay channel. Next, two new coding strategies superimposing cooperation and facilitation are developed. One of the coding strategies is shown to include the generalized strategy of Cover and El Gamal. For certain parameters of the Gaussian relay channel, the two new strategies give higher achievable rates than the generalized strategy of Cover and El Gamal","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"New coding strategies for the relay channel\",\"authors\":\"Hon-Fah Chong, M. Motani, H. K. Garg\",\"doi\":\"10.1109/ISIT.2005.1523507\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies coding strategies for a three-node relay channel. We first review the basic coding strategies of Cover and El Gamal for the relay channel. Next, two new coding strategies superimposing cooperation and facilitation are developed. One of the coding strategies is shown to include the generalized strategy of Cover and El Gamal. For certain parameters of the Gaussian relay channel, the two new strategies give higher achievable rates than the generalized strategy of Cover and El Gamal\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523507\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper studies coding strategies for a three-node relay channel. We first review the basic coding strategies of Cover and El Gamal for the relay channel. Next, two new coding strategies superimposing cooperation and facilitation are developed. One of the coding strategies is shown to include the generalized strategy of Cover and El Gamal. For certain parameters of the Gaussian relay channel, the two new strategies give higher achievable rates than the generalized strategy of Cover and El Gamal
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
