{"title":"通过用户合作提高双向中继信道的传输速率","authors":"Ahmad Abu Al Haija, M. Vu","doi":"10.1109/CWIT.2015.7255184","DOIUrl":null,"url":null,"abstract":"We analyze the impact of user cooperation in the two-way relay channel (TWRC) by letting each user send a quantized version of its received signal in addition to its own message. The proposed scheme is based on quantize-forward (QF) and partial decode-forward (PDF) relaying with sliding window decoding at the relay, and QF relaying with backward decodings at each user. For Gaussian channels, examples show that although there is no improvement on the sum rate, the individual rate can be significantly increased. Moreover, as the power of one user approaches infinity, the transmission rate of the other user asymptotically achieves the capacity by reaching the cut-set bound. Hence, such user cooperation may be useful in networks where users have different priorities.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improving transmission rate for the two-way relay channel by user cooperation\",\"authors\":\"Ahmad Abu Al Haija, M. Vu\",\"doi\":\"10.1109/CWIT.2015.7255184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze the impact of user cooperation in the two-way relay channel (TWRC) by letting each user send a quantized version of its received signal in addition to its own message. The proposed scheme is based on quantize-forward (QF) and partial decode-forward (PDF) relaying with sliding window decoding at the relay, and QF relaying with backward decodings at each user. For Gaussian channels, examples show that although there is no improvement on the sum rate, the individual rate can be significantly increased. Moreover, as the power of one user approaches infinity, the transmission rate of the other user asymptotically achieves the capacity by reaching the cut-set bound. Hence, such user cooperation may be useful in networks where users have different priorities.\",\"PeriodicalId\":426245,\"journal\":{\"name\":\"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2015.7255184\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2015.7255184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improving transmission rate for the two-way relay channel by user cooperation
We analyze the impact of user cooperation in the two-way relay channel (TWRC) by letting each user send a quantized version of its received signal in addition to its own message. The proposed scheme is based on quantize-forward (QF) and partial decode-forward (PDF) relaying with sliding window decoding at the relay, and QF relaying with backward decodings at each user. For Gaussian channels, examples show that although there is no improvement on the sum rate, the individual rate can be significantly increased. Moreover, as the power of one user approaches infinity, the transmission rate of the other user asymptotically achieves the capacity by reaching the cut-set bound. Hence, such user cooperation may be useful in networks where users have different priorities.