摘要
提出一种基于修正共轭梯度算法的恒模(MCG-CMA)盲干扰抑制算法,该算法将修正共轭梯度方法引入到恒模算法中,克服了传统恒模算法收敛缓慢、LS-CMA运算量大的缺点,保留了较好的计算复杂度和数值稳定性,理论推导了算法失调量的显式表达式。仿真结果表明该算法不需要波达方向估计,与传统的LS-CMA算法、SCG-CMA算法相比,具有较好的收敛性能和输出信干噪比(SINR)。
This paper presents and analyzes a constant modulus algorithm (CMA) adaptive beamforming algorithm which is based on conjugate gradient method. This algorithm focuses on a new technique for data block modificatory method with conjugate gradient, and overcomes the shortcoming of traditional CMA algorithms, such as slow convergence speed or vast complexity. An analysis is given to fred the misadjustments performance in MCG-CMA algorithm with different sampling length. Computer simulations show that the algorithm has better convergence performance and better signal to interference plus noise ratio (SINR) capability than LS-CMA and SCG-CMA algorithm.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2008年第4期511-514,共4页
Journal of University of Electronic Science and Technology of China
基金
国家自然科学基金(60472051)
部级预研项目(51421010705JB3804)
关键词
恒模算法
共轭梯度
失调量
信干噪比
CMA
conjugate gradient
misadjustments performance
SINR