秩亏缺信道下快速发射天线选择算法  

Transmit Antenna Selection Based on QR Decomposition with Column Pivoting for a Low Rank Matrix Channel

作　　者：朱耀麟[1] 宋晓梅[1] 卫建华[1] 薛谦[1] 

机构地区：[1]西安工程大学电子信息学院,西安710048

出　　处：《科学技术与工程》2008年第3期656-659,共4页Science Technology and Engineering

摘　　要：研究了秩亏缺信道下发射天线选择问题。为了保证信道矩阵是列满秩,因此选择出的天线子集中的发射天线数量等于信道矩阵的帙数。提出了容量最优化的发射天线选择算法,但这种算法的计算量太大了。因此,提出了一种基于列主元QR分解的发射天线选择算法,这种算法具有很低计算复杂度。仿真结果显示通过这种方法确定的天线子集在信道容量方面也有很好的性能,尤其在高信噪比情况。Transmit antenna selection for a low rank matrix channel is investigated. The number of chosen transmit antennas is equal to the rank of channel matrix to ensure that the resulting channel matrix is full column rank. A transmit antenna selection algorithm is proposed based on capacity maximization, however, the algorithm has burden computational load. Therefore, a transmit antenna selection algorithm based on QR decomposition with column pivoting is put forward, which is easy to compute. Simulation results show that it has good performance in channel capacity, especially in the case of high SNR.

关 键 词：发射天线选择 秩亏缺信道 列主元QR分解 依次剔除选择 

分 类 号：TN929.5[电子电信—通信与信息系统]