线性约束差分恒模算法

线性约束恒模算法(LCCM)能解决恒模算法(CMA)中存在的干扰捕获问题,但该算法需要将目标模值σ作为一个参数包含在代价函数中进行优化,因而收敛速度较慢.为克服这一缺点,本文提出了一种线性约束差分恒模算法(LCDCM),它可有效避免对最优σ值的搜索.在单干扰源的情况下,该算法的收敛速度和干扰抑制度均优于σ初始值设置不合适的LCCM算法;存在多个干扰源时,即使对LCCM算法的σ初始值进行最优设置,其对独立干扰源的收敛性能也不如LCDCM算法.

Differential Constant Modulus Algorithm with Linear Constraints

Linear constrained constant modulus algorithm (LCCM) is an effective solution to the problem of interference capture in constant modulus algorithm (CMA).But it suffers a slow convergence speed because the target modulus value σ needs to be included in the cost function to be optimized as a parameter.In order to overcome the shortage,this paper proposes a linear constrained differential constant modulus algorithm (LCDCM),which can avoid the search for optimum σ value.For the situation of only one interference existed,this proposed algorithm converges faster and mitigates interference more deeply than LCCM algorithm when the initial σ value isn't properly set.When adaptive array operates in an environment with more than one interference,the LCDCM algorithm has much more convergence characteristic than LCCM algorithm for individual interferences cancellation even when the σ value is optimumly set.