首页> 外文会议>2012 IEEE International Symposium on Information Theory Proceedings >Subspace alignment chains and the degrees of freedom of the three-user MIMO interference channel
【24h】

Subspace alignment chains and the degrees of freedom of the three-user MIMO interference channel

机译:子空间对准链和三用户MIMO干扰信道的自由度

获取原文
获取原文并翻译 | 示例

摘要

We show that the 3 user MT × MR MIMO interference channel where each transmitter is equipped with MT and each receiver is equipped with MR antennas has min (M/2−1/k, N/2+1/k) degrees of freedom (DoF) per user normalized by time, frequency, and space dimensions, where N = max(MT, MR), M = min(MT, MR), k = [M/N−M]. While the information theoretic DoF outer bound is established for every M, N value, the achievability, relying only on linear interference alignment, is established in general subject to a normalization with respect to spatial-extensions, i.e., the scaling of the number of antennas at all nodes. In the absence of spatial extensions, we can also show through examples how essentially the same alignment scheme may be applied over time or frequency extensions. The central new insight to emerge from this work is the notion of subspace alignment chains as DoF bottlenecks. The subspace alignment chains are instrumental both in identifying the extra dimensions provided by a genie to a receiver for the DoF outer bound, as well as constructing the optimal interference alignment schemes. In addition, our results also settle the question of feasibility of linear interference alignment for the 3 user MT × MR MIMO interference channel, for all values of MT, MR.
机译:我们显示了3个用户MT×MR MIMO干扰信道,其中每个发射机配备MT,每个接收机配备MR天线具有最小(M / 2-1 / k,N / 2 + 1 / k)自由度(通过时间,频率和空间尺寸归一化的每个用户的DoF),其中N =最大值(MT,MR),M =最小值(MT,MR),k = [M / N-M]。虽然针对每个M,N值都建立了信息理论DoF外部界限,但通常仅依赖于线性干扰对准来确定可达到性,但要针对空间扩展(即天线数量的缩放)进行归一化在所有节点上。在没有空间扩展的情况下,我们还可以通过示例说明如何在时间或频率扩展上基本上应用相同的对齐方案。从这项工作中得出的新的核心见解是作为DoF瓶颈的子空间对齐链的概念。子空间对准链在识别由精灵提供给DoF外边界的接收器的额外尺寸以及构造最佳干扰对准方案方面都非常有用。此外,我们的结果还解决了对于3个用户MT×MR MIMO干扰信道,对于所有MT,MR值进行线性干扰对准的可行性问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号