基于矩阵特征值分解的MIMO天线选择算法

An Antenna Selection Algorithm Based on Matrix Eigenvalue Decomposition in MIMO System

天线子集选择技术是一种有效的低代价且能够获得MIMO好处的技术。文中提出了一种基于矩阵特征值分解的天线选择算法以最大化信道容量,它将大的搜索空间分成若干小区间,在较小的搜索空间中采用穷举法。分析了所提算法及相关算法的计算复杂度。仿真实验表明,该算法能够获得接近穷举法的中断容量性能而且具有较低的计算复杂度。

The antenna subset selection is an efficient low-cost technique to obtain many advantages of MIMO systems. In this paper, an antenna selection algorithm to get maximum channel capacity based on matrix eigenvalue decomposition is proposed. Using exhausted algorithm it searches the small space which is the divided part of a large space. The computational complexity of the pro- posed method and related algorithm are given. Simulation results demonstrate that the presented algorithm achieves almost the same outage capacity as the optimal selection technique while having low computational complexity.