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

doi:10.1109/TWC.2016.2544758

	Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit
	Yuanming Shi1 ; Jun Zhang 2; Khaled B. Letaief 3
	2016-07
发表期刊	IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS (IF:8.9[JCR-2023],8.6[5-Year])
ISSN	1536-1276
卷号	15 期号:7 页码:4703-4717
发表状态	已发表
DOI	10.1109/TWC.2016.2544758
摘要	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.
关键词	Interference alignment topological interference management degrees-of-freedom index coding low-rank matrix completion Riemannian optimization quotient manifolds
URL	查看原文
收录类别	SCI ; EI
语种	英语
资助项目	Hong Kong Research Grant Council[610113]
WOS研究方向	Engineering ; Telecommunications
WOS类目	Engineering, Electrical & Electronic ; Telecommunications
WOS记录号	WOS:000381502100017
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
EI入藏号	20163002640940
EI主题词	Channel state information ; Codes (symbols) ; Degrees of freedom (mechanics) ; Iterative methods ; Mechanics ; Topology
EI分类号	Data Processing and Image Processing:723.2 ; Mathematics:921 ; Mechanics:931.1
WOS关键词	SCALE CONVEX-OPTIMIZATION ; COOPERATIVE NETWORKS ; ALIGNMENT ; FREEDOM ; CSIT
原始文献类型	Article
来源库	IEEE
引用统计	正在获取...
文献类型	期刊论文
条目标识符	https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/1786
专题	信息科学与技术学院信息科学与技术学院_PI研究组_石远明组
作者单位	1.School of Information Science and Technology, ShanghaiTech University, Shanghai, China 2.Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong 3.Hamad bin Khalifa University, Ar-Rayyan, Qatar
第一作者单位	信息科学与技术学院
第一作者的第一单位	信息科学与技术学院
推荐引用方式 GB/T 7714	Yuanming Shi,Jun Zhang,Khaled B. Letaief. Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit[J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS,2016,15(7):4703-4717.
APA	Yuanming Shi,Jun Zhang,&Khaled B. Letaief.(2016).Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit.IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS,15(7),4703-4717.
MLA	Yuanming Shi,et al."Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit".IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 15.7(2016):4703-4717.