Interference Alignment in Two-Way Relay Networks via Rank Constraints Rank Minimization

作     者：Xue Jiang Baoyu Zheng Yuelin Du 

作者机构：College of Telecommunications & Information Engineering Nanjing University of Posts and Telecommunications 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2017年第14卷第7期

页      面：195-203页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0839[工学-网络空间安全] 0804[工学-仪器科学与技术] 080402[工学-测试计量技术及仪器] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Science Foundation of China (NO.61271240  61671253) 

主　　题：中继网 干扰 用户网络管理 最小化算法 极小化 加权方法 对准 空间维度 

摘      要：Interference alignment(IA) is one of the promising measures for the multi-user network to manage interference. The rank constraints rank minimization means that interference spans the lowest dimensional subspace and the useful signal spans all available spatial dimensions. In order to improve the performance of two-way relay network, we can use rank constrained rank minimization(RCRM) to solve the IA problem. This paper proposes left reweighted nuclear norm minimization-γalgorithm and selective coupling reweighted nuclear norm minimization algorithm to implement interference alignment in two-way relay networks. The left reweighted nuclear norm minimization-γ algorithm is based on reweighted nuclear norm minimization algorithm and has a novel γ choosing rule. The selective coupling reweighted nuclear norm minimization algorithm weighting methods choose according to singular value of interference matrixes. Simulation results show that the proposed algorithms considerably improve the sum rate performance and achieve the higher average achievable multiplexing gain in two-way relay interference networks.