一种新的盲多用户检测算法  

A New CMA Algorithm in Blind Multiuser Detection

作　　者：李昌斌[1] 

机构地区：[1]深圳职业技术学院电子与通信工程学院,广东深圳518055

出　　处：《通信技术》2013年第4期62-64,共3页Communications Technology

摘　　要：恒模算法(CMA)是盲多用户检测中利用高阶统计量作为代价函数的自适应算法,但其步长恒定,不能随通信信道实际情况变化。在CMA和线性约束恒模算法(LCCMA)的基础上,将自适应步长引入到CMA中,得到自适应步长恒模算法(ASCMA),该算法能够根据通信信道情况自适应调节滤波器的步长,从而改善CMA算法的性能。通过MATLAB仿真表明,在白噪声通信信道环境中,ASCMA与LCCM相比,其输出信干比(SIR)、收敛速度等性能都有了较大的提高。CMA （constant modulus algorithm） algorithm is an adaptive algorithm with higher- order statistics as cost function in the bind multi-user detection, and however for its fixed step-size, could not change according to the actual situation of the channel. Based on CMA and linear constraint constant modulus, the adaptive step-size is introduced into CMA, thus acquiring. ASCMA could optimally adapt the step size of blind multi-user detector in accordance with the actual channel condition. Simulations with Matlab show that ASCMA, as compared with LCCM, is of much better performance in SIR and converge speed, in AWGN channels.

关 键 词：直接序列码分多址 盲多用户检测 恒模算法 

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