...
首页> 外文期刊>Sensors >A Rapid Convergent Low Complexity Interference Alignment Algorithm for Wireless Sensor Networks
【24h】

A Rapid Convergent Low Complexity Interference Alignment Algorithm for Wireless Sensor Networks

机译:无线传感器网络的快速收敛的低复杂度干扰对准算法

获取原文
           

摘要

Interference alignment (IA) is a novel technique that can effectively eliminate the interference and approach the sum capacity of wireless sensor networks (WSNs) when the signal-to-noise ratio (SNR) is high, by casting the desired signal and interference into different signal subspaces. The traditional alternating minimization interference leakage (AMIL) algorithm for IA shows good performance in high SNR regimes, however, the complexity of the AMIL algorithm increases dramatically as the number of users and antennas increases, posing limits to its applications in the practical systems. In this paper, a novel IA algorithm, called directional quartic optimal (DQO) algorithm, is proposed to minimize the interference leakage with rapid convergence and low complexity. The properties of the AMIL algorithm are investigated, and it is discovered that the difference between the two consecutive iteration results of the AMIL algorithm will approximately point to the convergence solution when the precoding and decoding matrices obtained from the intermediate iterations are sufficiently close to their convergence values. Based on this important property, the proposed DQO algorithm employs the line search procedure so that it can converge to the destination directly. In addition, the optimal step size can be determined analytically by optimizing a quartic function. Numerical results show that the proposed DQO algorithm can suppress the interference leakage more rapidly than the traditional AMIL algorithm, and can achieve the same level of sum rate as that of AMIL algorithm with far less iterations and execution time.
机译:干扰对准(IA)是一种新颖的技术,通过将所需的信号和干扰投射到不同的信号中,可以有效消除干扰,并在信噪比(SNR)高时接近无线传感器网络(WSN)的总容量。信号子空间。 IA的传统交替最小干扰泄漏(AMIL)算法在高SNR体制下显示出良好的性能,但是,随着用户和天线数量的增加,AMIL算法的复杂性急剧增加,从而限制了其在实际系统中的应用。本文提出了一种新颖的IA算法,称为定向四次最优(DQO)算法,以最小的干扰收敛和快速的收敛性,降低了复杂度。研究了AMIL算法的性质,发现当中间迭代获得的预编码和解码矩阵足够接近收敛时,两次连续迭代结果之间的差异将近似指向收敛解。价值观。基于这一重要特性,提出的DQO算法采用了线搜索程序,因此可以直接收敛到目的地。另外,可以通过优化四次函数来分析确定最佳步长。数值结果表明,提出的DQO算法比传统的AMIL算法能够更快地抑制干扰泄漏,并且可以达到与AMIL算法相同的求和率,且迭代次数和执行时间要少得多。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号