自适应波束形成中两种恒模算法的性能比较  

Comparison of Two Constant Modulus Algorithms for Adaptive Beamforming

作　　者：郭艳[1] 李宁[1] 郭莉[2] 于振伟[3] 

机构地区：[1]解放军理工大学理学院数理系,江苏南京211101 [2]北京邮电大学信息工程学院,北京100088 [3]解放军理工大学通信工程学院电子信息工程系,江苏南京210007

出　　处：《军事通信技术》2004年第3期5-7,50,共4页Journal of Military Communications Technology

摘　　要：自适应波束形成技术是移动通信和信号处理领域中的热点,文中比较了自适应波束形成中的两种恒模算法-随机梯度恒模算法和最小二乘恒模算法,发现在弱干扰环境下,两者性能相当;而在强干扰环境下,最小二乘恒模算法通常会收敛于功率较强的信号而产生错捕;而随机梯度恒模算法则通过对步长因子的控制可以有效地捕获用户信号。The adaptive beamforming algorithm is the key technique in mobile communication and signal processing. Two kinds of the constant modulus algorithms for the adaptive beamforming algorithm-the stochastic gradient constant modulus algorithm was compared with the least square constant modulus algorithm. When the interference signal is weaker than the desired signal, the performance of the two algorithms is almost the same. Under strong interference, the least square constant modulus algorithm will converge to the strong signal, which leads to the 'wrong capture', while ths stochastic gradient effectively captures the desired signal due to its control on the stepsize.

关 键 词：移动通信 自适应波束形成 恒模算法 

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