传统的基于信道容量最大化准则的天线选择算法虽然使信道容量达到了最大化,但是计算复杂度很高。针对计算复杂度高的问题,提出了一种基于Doolittle-QR分解的低复杂度天线选择算法。该算法基于DoolittleQR分解,可以快速选择出使系统容量最大化的天线。与传统的天线选择算法相比,该算法的计算复杂度不仅有效地降低了,而且容量性能相近。在60GHz室内信道下,仿真实验结果表明,该算法具有良好的容量性能,优于随机天线选择算法,接近最优天线选择算法。 The traditional antenna selection algorithm based on the channel capacity maximization maximizes the channel capacity, but the computational complexity is high. To solve the problem of high computational complexity, a low complexity antenna selection algorithm based on Doolittle-QR decomposition is proposed. Based on Doolittle QR decomposition, the algorithm quickly selects the antenna that maximizes the system’s capacity. Compared with the traditional antenna selection algorithm, the computational complexity of the algorithm is not only reduced effectively, but also the capacity performance is similar. Under the 60GHz indoor channel, the simulation results show that the proposed algorithm has good capacity performance, which is better than the random antenna selection algorithm and close to the optimal antenna selection algorithm.