摘要
低秩空间的干扰对齐算法对无线通信网络的干扰抑制效果较好,但因其高复杂度而难以得到广泛应用。针对该算法高复杂度的缺点,提出对干扰系统内所有IA收发滤波并行处理的优化算法,并通过拉格朗日条件极值得到该算法的理论容量上界,最后进行算例仿真对比。结果表明,该优化算法能够在保证网络容量的条件下,降低算法的复杂度。
Interference alignment algorithm based on the low rank space is very meaningful for heterogeneous network. However,its high complexity makes it difficult to obtain a wide range of practical applications. In order to reduce the complexity of the algorithm,this paper proposes all IA transceiver interference filtering system within parallel processing optimization algorithm,and obtains theoretical capacity of the algorithm boundaries by Lagrange Extreme conditions. Finally,it also conducted numerical simulation examples comparison. The results show that the optimization algorithm can ensure the system capacity under conditions and achieve low complexity algorithm.
出处
《重庆科技学院学报（自然科学版）》
CAS
2016年第2期117-120,共4页
Journal of Chongqing University of Science and Technology：Natural Sciences Edition
基金
江苏省高校品牌专业建设工程资助项目"基于3G技术的高职电子技术课程移动学习策略研究"(22700)
关键词
干扰对齐
低复杂度
网络容量
低秩空间
Interference Alignment
low complexity
network capacity
low rank space
