基于RLS的改进型盲多用户检测算法  

Improved blind multi-user detection algorithm based on RLS

作　　者：刘婷[1] 张立毅[1] 孙云山[1] 

机构地区：[1]天津商业大学信息工程学院,天津300134

出　　处：《计算机工程与设计》2008年第6期1342-1344,共3页Computer Engineering and Design

基　　金：中国博士后基金项目(20060390170);山西省自然科学基金项目(20051038)

摘　　要：针对传统的关于可变约束MOE盲多用户检测算法需直接进行特征值分解计算和不能实现二次约束限制的缺点,提出了一种基于RLS的改进型MOE盲多用户检测算法。该算法避免了矩阵求逆和大量的特征值分解运算,计算复杂度大大降低。仿真结果表明,该算法的误码率性能和收敛性均优于直接利用特征值分解的传统算法,且程序运行时间大大缩小。An improved MOE blind multi-user detection algorithm based on RLS is proposed in order to overcome the shortcomings that the direct eigenvalue decomposition must be used and the quadratic constraint is not fulfilled in the traditional variable constraint MOE blind multi-user detection algorithm.The improved algorithm can avoid the matrix inverse and a lot of eigenvalue decomposition ope-ration.Therefore,the computational complexity is greatly reduced.Computer simulations show that the bit error rate performance and convergence ability of the improved algorithm are all better than that of the traditional algorithm which makes use of eigenvalue decom-position directly.Moreover,the time that the improved algorithm spends is less than the traditional algorithm spends.

关 键 词：MOE盲多用户检测 可变约束 固定约束 二次约束 RLS算法 

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