{"title":"Approximate capacity of a class of multi-source Gaussian relay networks","authors":"Sang-Woon Jeon, Sae-Young Chung, S. Jafar","doi":"10.1109/CIG.2010.5592674","DOIUrl":null,"url":null,"abstract":"We study K-user M-hop Gaussian relay networks with K<inf>m</inf> nodes in the m-th layer, where M is even and K = K<inf>1</inf> = K<inf>M+1</inf>. We observe that the time-varying nature of wireless channels (fading) can be exploited to mitigate the inter-user interference. The proposed block Markov encoding and relaying scheme exploits such channel variations and works for any isotropically distributed channels including Rayleigh fading. We show a general achievable degrees of freedom (DoF) region of this class of Gaussian relay networks, which coincides with the cut-set outer bound if M/K<inf>min</inf> is an integer, where K<inf>min</inf> = min<inf>m</inf> {K<inf>m</inf>}. Therefore, we completely characterize the DoF region for the case where M/K<inf>min</inf> is an integer.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
We study K-user M-hop Gaussian relay networks with Km nodes in the m-th layer, where M is even and K = K1 = KM+1. We observe that the time-varying nature of wireless channels (fading) can be exploited to mitigate the inter-user interference. The proposed block Markov encoding and relaying scheme exploits such channel variations and works for any isotropically distributed channels including Rayleigh fading. We show a general achievable degrees of freedom (DoF) region of this class of Gaussian relay networks, which coincides with the cut-set outer bound if M/Kmin is an integer, where Kmin = minm {Km}. Therefore, we completely characterize the DoF region for the case where M/Kmin is an integer.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
