arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.6512cs.ITmath.IT
收藏

蜂窝干扰对齐:全向信标和非对称信标

Cellular Interference Alignment: Omni-Directional Antennas and Asymmetric Configurations

Vasilis Ntranos, Mohammad Ali Maddah-Ali, Giuseppe Caire

摘要:

虽然干扰对齐(IA)理论上可以在$K$ -用户高斯干扰信道中实现最佳自由度(DoF),但是其直接应用以在指数许多信令维度上进行预编码的高昂成本来实现。另一方面,众所周知,实用的“一次性”IA预编码(即,没有符号扩展的线性方案)在具有通用信道系数的大型全连接网络中提供了消失的DoF增益。在我们以前的工作中,我们介绍了“蜂窝IA”的概念,由六边形小区扇区和最近邻干扰引起的网络拓扑结构。假设相邻扇区可以在上行链路中交换解码消息(而不是接收到的信号样本),我们表明,在$M$发射/接收天线上的线性一次性IA预编码可以实现每个用户的最佳$M/2$ DoF。在本文中,我们将此框架扩展到网络的全向(非扇区化)的细胞,并考虑实际情况下,用户有$2$天线,和基站有$2$,$3$或$4$天线。特别是,我们提供了线性一次注射IA计划的$2\times 2$,$2\times3$和$2\times 4$的情况下,并显示可扩展性的$3/4$,$1$和$7/6$自由度每个用户,分别。单次方案的自由度转换需要解决随着网络规模增长的多个变量的离散优化问题。我们开发了一种新的方法,将这样具有挑战性的优化问题转化为一个易于处理的线性规划(LP),具有显着较少的变量。该方法用于表明,每个用户可实现的$3/4$ DoF对于具有$2\times 2$链路的大型(扩展)蜂窝网络确实是最佳的。

英文摘要:

Although interference alignment (IA) can theoretically achieve the optimal degrees of freedom (DoFs) in the $K$-user Gaussian interference channel, its direct application comes at the prohibitive cost of precoding over exponentially-many signaling dimensions. On the other hand, it is known that practical "one-shot" IA precoding (i.e., linear schemes without symbol expansion) provides a vanishing DoFs gain in large fully-connected networks with generic channel coefficients. In our previous work, we introduced the concept of "Cellular IA" for a network topology induced by hexagonal cells with sectors and nearest-neighbor interference. Assuming that neighboring sectors can exchange decoded messages (and not received signal samples) in the uplink, we showed that linear one-shot IA precoding over $M$ transmit/receive antennas can achieve the optimal $M/2$ DoFs per user. In this paper we extend this framework to networks with omni-directional (non-sectorized) cells and consider the practical scenario where users have $2$ antennas, and base-stations have $2$, $3$ or $4$ antennas. In particular, we provide linear one-shot IA schemes for the $2\times 2$, $2\times3$ and $2\times 4$ cases, and show the achievability of $3/4$, $1$ and $7/6$ DoFs per user, respectively. DoFs converses for one-shot schemes require the solution of a discrete optimization problem over a number of variables that grows with the network size. We develop a new approach to transform such challenging optimization problem into a tractable linear program (LP) with significantly fewer variables. This approach is used to show that the achievable $3/4$ DoFs per user are indeed optimal for a large (extended) cellular network with $2\times 2$ links.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑