User Selection in MIMO Interfering Broadcast Channels
User Selection in MIMO Interfering Broadcast Channels
复制标题
MIMO 干扰广播信道中的用户选择
DOI：
--
复制
发表时间：
2013
影响因子：
8.3
通讯作者：
A. Chaturvedi
中科院分区：
文献类型：
--
作者：
Gaurav Gupta;A. Chaturvedi
干涉对准的目的是在干涉系统中实现最大的自由度。为了在干扰广播系统中实现干扰对准，提出了一种封闭的解决方案。在有大量用户的下行场景中，要求基站选择一个用户子集，以使总速率最大化。由于存在大量可能的用户子集组合，使用暴力方法搜索最优用户子集在计算上是穷举的。提出了一种和率接近最优解和率的用户选择算法。该算法采用坐标上升法，利用期望信号空间与互易系统中干扰信道空间的正交性来选择每一步的用户。为了完整起见，我们还将基于和率方法的算法扩展到干扰广播信道。这两种算法的复杂性与用户总数呈线性关系，而在暴力搜索中呈指数关系。
Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in which is an extension of the grouping scheme in . In a downlink scenario where there are a large number of users, the base station is required to select a subset of users such that the sum rate is maximized. To search for the optimal user subset using brute-force approach is computationally exhaustive because of the large number of possible user subset combinations. We propose a user selection algorithm achieving sum rate close to that of optimal solution. The algorithm employs coordinate ascent approach and exploits orthogonality between the desired signal space and the interference channel space in the reciprocal system to select the user at each step. For the sake of completeness, we have also extended the sum rate approach based algorithm to Interfering broadcast channel. The complexity of both these algorithms is shown to be linear with respect to the total number of users as compared to exponential in brute-force search.