相关信道下低复杂度的发射天线选择算法  

A Low Complexity Transmit Antenna Selection Algorithm over a Correlated Fading Channel

作　　者：徐立勤[1] 季玉洁[1] 

机构地区：[1]南京邮电大学电子科学与工程学院,江苏南京210023

出　　处：《南京邮电大学学报（自然科学版）》2013年第3期70-74,共5页Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition

基　　金：国家重点基础研究发展计划(973计划)(2007CB310603)资助项目

摘　　要：文中借助于矩阵奇异值最小下界的估计方法,提出了一种基于盖尔圆算法的天线选择新算法。该算法的关键就是在选择天线的每次迭代过程中,采用的是选择使信道矩阵最小奇异值下界最大的列。该算法在减小天线间的相关性的同时,也使得所优化的系统的容量最大化以及误码率最小化。仿真结果表明,该算法不仅降低了计算复杂度,而且所得到的信道容量明显优于随机选择算法和小幅度高于盖尔圆算法。In this paper,a new antenna selection algorithm based on Gail circle algorithm is presented by means of estimation minimum lower bound of singular value of matrix determinant.The proposed algorithm uses the lower bound of the minimum singular value given by the singular value estimation method,and selects the column whose minimum singular value is maximum in each iteration to raise the minimum singular value and reduce antenna correlation.The simulation results show that the complexity of this algorithm is much lower than the traditional Gail circle algorithm and the capacity and the BER performance is better than random selection algorithm and close to the optimal selection algorithm.

关 键 词：MIMO 相关信道 天线选择算法 奇异值下界估计 

分 类 号：TN92[电子电信—通信与信息系统] TN82[电子电信—信息与通信工程]