循环单向配合的干扰对准

M. R. Nakhai, Aimal Khan Yousafzai
{"title":"循环单向配合的干扰对准","authors":"M. R. Nakhai, Aimal Khan Yousafzai","doi":"10.1109/ICC.2012.6364189","DOIUrl":null,"url":null,"abstract":"Recent results on interference alignment (IA) in a K-user n × n MIMO interference channel, have shown that the ratio of total degrees of freedom d̂ to the single user degrees of freedom varies from d̂/n <; 2 in the case of arbitrary MIMO channels (i.e., channels with no structure) to K/2 in the case of channels with diagonal structure (i.e., channels with time or frequency varying coefficients). These results confirm that the information theoretic upper bound on degrees of freedom with no channel extension can only be achieved for K ≤ 3 with an overwhelming overhead of the global channel knowledge or an extensive number of back-and-forth iterations between the transmitting and the receiving nodes [3]. In this paper, we show that this limit on the number of users can be extended to K ≤ 5 as a result of introducing a partial cooperation into the interference channel. This partial cooperation is such that the message of the kth transmitter or base station (BS) is known to the [k - 1)th transmitter (mod K) and each receiver or user is simultaneously served by two transmitters. We introduce a one-shot algorithm that utilizes the reciprocity of wireless network to achieve interference alignment with no iterations between the transmitting and the receiving nodes when d̂/n ≤ 2. Monte-Carlo simulation results show that the proposed partial cooperation used with the one-shot algorithm can considerably enhance the sum rate in an interference channel system at practical SNR levels as a result of improved spatial multiplexing gain.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Interference alignment with cyclic unidirectional cooperation\",\"authors\":\"M. R. Nakhai, Aimal Khan Yousafzai\",\"doi\":\"10.1109/ICC.2012.6364189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent results on interference alignment (IA) in a K-user n × n MIMO interference channel, have shown that the ratio of total degrees of freedom d̂ to the single user degrees of freedom varies from d̂/n <; 2 in the case of arbitrary MIMO channels (i.e., channels with no structure) to K/2 in the case of channels with diagonal structure (i.e., channels with time or frequency varying coefficients). These results confirm that the information theoretic upper bound on degrees of freedom with no channel extension can only be achieved for K ≤ 3 with an overwhelming overhead of the global channel knowledge or an extensive number of back-and-forth iterations between the transmitting and the receiving nodes [3]. In this paper, we show that this limit on the number of users can be extended to K ≤ 5 as a result of introducing a partial cooperation into the interference channel. This partial cooperation is such that the message of the kth transmitter or base station (BS) is known to the [k - 1)th transmitter (mod K) and each receiver or user is simultaneously served by two transmitters. We introduce a one-shot algorithm that utilizes the reciprocity of wireless network to achieve interference alignment with no iterations between the transmitting and the receiving nodes when d̂/n ≤ 2. Monte-Carlo simulation results show that the proposed partial cooperation used with the one-shot algorithm can considerably enhance the sum rate in an interference channel system at practical SNR levels as a result of improved spatial multiplexing gain.\",\"PeriodicalId\":331080,\"journal\":{\"name\":\"2012 IEEE International Conference on Communications (ICC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2012.6364189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2012.6364189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

最近关于k用户n × n MIMO干扰通道中干扰对准(IA)的研究结果表明,总自由度d³与单用户自由度的比值d³/n <;在任意MIMO信道(即无结构信道)情况下为2,到对角结构信道(即时变或变频系数信道)情况下为K/2。这些结果证实,在没有信道扩展的情况下,只有当K≤3时,全局信道知识的开销过大,或者在发送和接收节点之间进行大量的来回迭代时,才能实现自由度的信息理论上限[3]。在本文中,我们证明了通过在干扰信道中引入部分合作,可以将用户数量的限制扩展到K≤5。这种部分合作使得第k个发射机或基站(BS)的消息为第k - 1个发射机(mod k)所知,并且每个接收器或用户同时由两个发射机服务。本文介绍了一种利用无线网络互易性的一次性算法,在d /n≤2时,实现了发射节点与接收节点之间不迭代的干扰对准。蒙特卡罗仿真结果表明,在实际信噪比水平的干扰信道系统中,由于提高了空间复用增益,所提出的局部协作与单次算法相结合可以显著提高和速率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interference alignment with cyclic unidirectional cooperation
Recent results on interference alignment (IA) in a K-user n × n MIMO interference channel, have shown that the ratio of total degrees of freedom d̂ to the single user degrees of freedom varies from d̂/n <; 2 in the case of arbitrary MIMO channels (i.e., channels with no structure) to K/2 in the case of channels with diagonal structure (i.e., channels with time or frequency varying coefficients). These results confirm that the information theoretic upper bound on degrees of freedom with no channel extension can only be achieved for K ≤ 3 with an overwhelming overhead of the global channel knowledge or an extensive number of back-and-forth iterations between the transmitting and the receiving nodes [3]. In this paper, we show that this limit on the number of users can be extended to K ≤ 5 as a result of introducing a partial cooperation into the interference channel. This partial cooperation is such that the message of the kth transmitter or base station (BS) is known to the [k - 1)th transmitter (mod K) and each receiver or user is simultaneously served by two transmitters. We introduce a one-shot algorithm that utilizes the reciprocity of wireless network to achieve interference alignment with no iterations between the transmitting and the receiving nodes when d̂/n ≤ 2. Monte-Carlo simulation results show that the proposed partial cooperation used with the one-shot algorithm can considerably enhance the sum rate in an interference channel system at practical SNR levels as a result of improved spatial multiplexing gain.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信