{"title":"Throughput analysis of type-I HARQ strategies in Two-Way Relay Channels","authors":"F. Iannello, O. Simeone","doi":"10.1109/CISS.2009.5054779","DOIUrl":null,"url":null,"abstract":"A Two-Way Relay Channels (TWRC) is studied over quasi-static fading channels by focusing on the throughput of Type-I HARQ strategies. An upper bound is evaluated, along with a number of achievable results obtained by proposing different protocols combining Type-I HARQ with standard amplify or decode-and-forward techniques or more sophisticated lattice code-based strategies. Performance comparison among the different protocols shows a trade-off between the achievable throughput and the system overhead required to obtain partial channel state information at the nodes.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 43rd Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2009.5054779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
A Two-Way Relay Channels (TWRC) is studied over quasi-static fading channels by focusing on the throughput of Type-I HARQ strategies. An upper bound is evaluated, along with a number of achievable results obtained by proposing different protocols combining Type-I HARQ with standard amplify or decode-and-forward techniques or more sophisticated lattice code-based strategies. Performance comparison among the different protocols shows a trade-off between the achievable throughput and the system overhead required to obtain partial channel state information at the nodes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
