{"title":"虚拟全双工中继的通用计算和转发","authors":"Roshan S. Sam, Antony V. Mampilly, S. Bhashyam","doi":"10.1109/NCC.2019.8732252","DOIUrl":null,"url":null,"abstract":"Motivated by the wireless backhaul application, multihop virtual full duplex relaying using a successive relaying protocol based on compute-and-forward (CoF) was proposed recently by Hong and Caire. The channel gain in each hop was assumed to be equal. In this paper, we consider multihop virtual full duplex relaying where the gain in the different hops can be unequal. We use the recently proposed general compute-and-forward (GCoF) scheme along with successive relaying. GCoF eliminates the non-integer penalty present in CoF or the CoF with simple power allocation used earlier. We determine the achievable rate of virtual full duplex relaying using GCoF for the multihop case and show that this rate is within a constant gap (also independent of the number of hops) of the cutset upper bound under some assumptions.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"41 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"General Compute and Forward for Virtual Full-Duplex Relaying\",\"authors\":\"Roshan S. Sam, Antony V. Mampilly, S. Bhashyam\",\"doi\":\"10.1109/NCC.2019.8732252\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by the wireless backhaul application, multihop virtual full duplex relaying using a successive relaying protocol based on compute-and-forward (CoF) was proposed recently by Hong and Caire. The channel gain in each hop was assumed to be equal. In this paper, we consider multihop virtual full duplex relaying where the gain in the different hops can be unequal. We use the recently proposed general compute-and-forward (GCoF) scheme along with successive relaying. GCoF eliminates the non-integer penalty present in CoF or the CoF with simple power allocation used earlier. We determine the achievable rate of virtual full duplex relaying using GCoF for the multihop case and show that this rate is within a constant gap (also independent of the number of hops) of the cutset upper bound under some assumptions.\",\"PeriodicalId\":6870,\"journal\":{\"name\":\"2019 National Conference on Communications (NCC)\",\"volume\":\"41 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2019.8732252\",\"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 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2019.8732252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
General Compute and Forward for Virtual Full-Duplex Relaying
Motivated by the wireless backhaul application, multihop virtual full duplex relaying using a successive relaying protocol based on compute-and-forward (CoF) was proposed recently by Hong and Caire. The channel gain in each hop was assumed to be equal. In this paper, we consider multihop virtual full duplex relaying where the gain in the different hops can be unequal. We use the recently proposed general compute-and-forward (GCoF) scheme along with successive relaying. GCoF eliminates the non-integer penalty present in CoF or the CoF with simple power allocation used earlier. We determine the achievable rate of virtual full duplex relaying using GCoF for the multihop case and show that this rate is within a constant gap (also independent of the number of hops) of the cutset upper bound under some assumptions.