arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.01729cs.ITmath.IT
收藏

拓扑干扰管理中的低秩矩阵Riemann追踪完备化

Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit

Yuanming Shi, Jun Zhang, Khaled B. Letaief

摘要:

在本文中,我们提出了一个灵活的低秩矩阵完成(LRMC)的拓扑干扰管理(TIM)的方法在部分连接的K-用户干扰信道。除了网络拓扑信息之外,在发射机处不需要信道状态信息(CSI)。以前对TIM问题的尝试主要是基于它与索引编码问题的等价性,但到目前为止,只有少数索引编码问题得到了解决。相比之下,在本文中,我们提出了一种算法的方法来研究可实现的自由度(DoF),通过重铸的TIM问题作为一个LRMC问题。不幸的是,由此产生的LRMC问题是已知的NP-困难的,本文的主要贡献是提出了一个黎曼追求(RP)的框架来检测的秩矩阵的秩被恢复迭代增加的秩。该算法解决了一系列固定秩矩阵的完备化问题。为了解决现有定秩优化方法中的收敛问题,通过黎曼优化利用了定秩矩阵的搜索空间的商流形几何。通过进一步利用低秩矩阵变体的结构,即,摘要利用固定秩矩阵集合的闭包,提出了一种有效的秩递增策略,以在秩追踪过程中找到好的初始点。仿真结果表明,所提出的RP算法实现了更快的收敛速度和更高的可实现自由度的TIM问题相比,国家的最先进的方法。

英文摘要:

In this paper, we present a flexible low-rank matrix completion (LRMC) approach for topological interference management (TIM) in the partially connected K-user interference channel. No channel state information (CSI) is required at the transmitters except the network topology information. The previous attempt on the TIM problem is mainly based on its equivalence to the index coding problem, but so far only a few index coding problems have been solved. In contrast, in this paper, we present an algorithmic approach to investigate the achievable degrees-of-freedom (DoFs) by recasting the TIM problem as an LRMC problem. Unfortunately, the resulting LRMC problem is known to be NP-hard, and the main contribution of this paper is to propose a Riemannian pursuit (RP) framework to detect the rank of the matrix to be recovered by iteratively increasing the rank. This algorithm solves a sequence of fixed-rank matrix completion problems. To address the convergence issues in the existing fixed-rank optimization methods, the quotient manifold geometry of the search space of fixed-rank matrices is exploited via Riemannian optimization. By further exploiting the structure of the low-rank matrix varieties, i.e., the closure of the set of fixed- rank matrices, we develop an efficient rank increasing strategy to find good initial points in the procedure of rank pursuit. Simulation results demonstrate that the proposed RP algorithm achieves a faster convergence rate and higher achievable DoFs for the TIM problem compared with the state-of-the-art methods.

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

↑