{"title":"多用户高斯并行中继网络","authors":"C. Sung, Ping Hu, K. Leung","doi":"10.1109/ISITA.2008.4895548","DOIUrl":null,"url":null,"abstract":"For the multiuser parallel relay network in which two users want to communicate with a destination through a parallel relay channel, we propose several coding strategies and derive their achievable rate regions. The results are analyzed and the strategies are shown to approach or achieve the outer bound under certain channel conditions.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The multiuser Gaussian parallel relay network\",\"authors\":\"C. Sung, Ping Hu, K. Leung\",\"doi\":\"10.1109/ISITA.2008.4895548\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the multiuser parallel relay network in which two users want to communicate with a destination through a parallel relay channel, we propose several coding strategies and derive their achievable rate regions. The results are analyzed and the strategies are shown to approach or achieve the outer bound under certain channel conditions.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895548\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895548","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
For the multiuser parallel relay network in which two users want to communicate with a destination through a parallel relay channel, we propose several coding strategies and derive their achievable rate regions. The results are analyzed and the strategies are shown to approach or achieve the outer bound under certain channel conditions.