基于迭代QR分解的MMSE V-BLAST算法  

MMSE V-BLAST Algorithm Based on Iterative QR Decomposition

作　　者：王赟[1] 汪晋宽[1] 宋昕[1] 解志斌[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2008年第1期65-68,共4页Journal of Northeastern University(Natural Science)

基　　金：高等学校博士学科点专项科研基金资助项目(20050145019)

摘　　要：针对采用最小均方误差(minimum mean square error,MMSE)检测算法在MIMO系统接收端进行检测时,需要进行大量伪逆运算导致检测复杂度增加的问题,提出了用一种基于迭代QR分解的MMSE V-BLAST算法,避免了伪逆运算,有效地降低了检测算法的复杂度,使系统检测性能得到了明显改善.在多散射物无线通信环境下进行仿真实验,结果表明,与传统的算法相比,提案算法在保证相同信噪比,误码率没有显著变化的前提下,系统检测复杂度明显改善.理论分析证明,系统中有效天线数目越多,所提出的算法优越性越明显.An improved MMSE （minimum mean square error） V-BLAST algorithm based on iterative QR decomposition is proposed to solve the problem that the complexity of detection becomes higher because lots of pseudo-inverse operations have to be taken when detecting the receiving end of MIMO system with MMSE algorithm. As a result, the complexity is reduced efficiently with the detection performance clearly improved. In the environment where lots of wireless communications were scattered over, a simulation testing was done and the results showed that the computation complexity of the proposed algorithm is obviously reduced in comparison with conventional algorithms only if the BER doesn＇ t change dramatically with the same SNR. The theoretical analysis proves that the more the number of effective antennae, the better the performance of the algorithm proposed.

关 键 词：MMSE V-BLAST 误码率 迭代QR分解 系统复杂度 

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