MIMO系统中快速联合收发天线选择算法

Fast joint transmit-receive antenna selection algorithm for MIMO systems

针对MIMO系统中多天线技术带来的成本和复杂度高的问题,在研究盖尔圆算法的基础上,提出一种快速联合收发天线选择算法,算法利用盖尔圆定理对特征值进行估计,并通过逐行逐列递增的方法,选择使矩阵最小特征值下界最大的行和列,从而使矩阵最小特征值下降最小.理论分析及仿真结果表明,该算法在射频链路较少时具有很低的复杂度,同时其容量接近最优穷举搜索算法.

MIMO systems with multiple antennas can cause a high cost and complexity.Focusing on this problem,a fast joint transmit-receive antenna selection algorithm is presented.The proposed algorithm uses the Gerschgorin circle theorem to estimate the eigen-values,and choose the row and column whose lower bound of the minimum eigen-value is the max by searching for the matrix row by row and column by column,so the minimum eigen-value of matrix declines to the least.Theoretical analysis and simulation results show that the capacity of the proposed algorithm is close to that of the optimal exhaustive search algorithm with low complexity in the case where the number of RF chains is small.