基于降元集合的组分层空时结构发送天线选择  

Transmit Antenna Selection Based on Reduced-Element Sets for Group Layered Space-Time Architectures

作　　者：于波[1,2] 张兴周[1] 吕秀丽[2] 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001 [2]大庆石油学院电子科学学院,大庆163318

出　　处：《数据采集与处理》2010年第4期490-494,共5页Journal of Data Acquisition and Processing

摘　　要：针对结合空时分组编码和分层空时的组分层空时(Group layered space-time,GLST)系统,提出了一种基于降元集合的发送天线选择算法。在信道矩阵列向量Euclidean范数排序的基础上,构建与较大范数列向量对应的天线元减少的集合。对该降元集合的子集进行重构信道矩阵QR分解,通过比较各子集R矩阵对角元素的最小值,选定与其最大值对应的天线子集。并结合采用正交空时分组编码和分层空时的GLST,分析了所提出算法的性能和计算复杂度。仿真结果表明,该算法的性能明显优于几种常见的快速天线子集选择算法。当合理选择降元集合元素数量时,该算法以很高的概率达到最优。For group layered space-time （GLST） combined with space-time coding and layered space-time, a fast antenna selection algorithm is presented based on the reduced-element set （RES）. According to column vectors sorted by Euclidean norm, RES of transmit antennas is built. Elements in RES are little more than active transmit antennas. Based on QR decomposition of the reconstructed channel matrices over all subsets in RES, minima of diagonal elements in R matrices is obtained, and the subset with the maximum is selected. For the combined orthogonal STBC and LST architectures, the performance and the computational complexity of the algorithm are analyzed. Simulation results show that the algorithm outperforms the existing methods, thus it can approach optimal performance with the high probability.

关 键 词：天线选择 组分层空时 空时分组编码 QR分解 

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