基于最小二乘恒模算法及子空间方法的盲多用户检测算法  

The lscm algorithm and subspace approach for blind multiuser detection

作　　者：刘胜美[1] 赵春明[1] 

机构地区：[1]东南大学移动通信国家重点实验室,江苏南京210096

出　　处：《通信学报》2003年第5期129-133,共5页Journal on Communications

摘　　要：恒模算法(CMA)是一种广泛应用于阵列处理、均衡、多用户检测中的盲算法。最小二乘恒模算法(LSCMA)由于其全局收敛性及稳定性受到关注,但是它在信噪比较低时性能不是很理想。本文将最小二乘恒模算法与子空间方法相结合,提出一种基于子空间分解的恒模算法,称为LSCM_SUB算法。仿真结果表明这种算法的收敛性能比LSCMA要好,尤其是在信噪比低的时候。The constant modulus algorithm(CMA) is a blind algorithm. It is applied in the array processing、equalization and multiuser detection widely. The least square CMA is a popular CMA because of its global convergence and stability. But its performance is not superior when the SNR is low. In this paper, we combine the LSCMA with the subspace approach and propose the 慙SCM_SUB?algorithm. Simulation results show that the proposed LSCM_SUB algorithm is superior to the LSCMA especially in the low SNR.

关 键 词：最小二乘恒模算法 LSCMA 子空间 LSCM_SUB 收敛性能 盲多用户检测 

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