盲信道均衡的欠定递推最小二乘恒模算法  

Underdetermined-order recursive least-squares CMA for blind channel equalization

作　　者：张曙霞[1] 蒋宇中[1] 

机构地区：[1]海军工程大学电子工程学院,武汉430033

出　　处：《海军工程大学学报》2010年第4期98-101,112,共5页Journal of Naval University of Engineering

摘　　要：在分析传统盲信道均衡恒模算法的基础上,提出一种基于恒模准则的欠定递推最小二乘盲信道均衡算法(URL-CMA)。新算法将多个新增数据点同时以矩阵形式参与迭代运算,有效地增加了使算法趋向收敛的信息。采用计算机仿真的方法对该算法与传统的恒模算法进行了盲均衡性能比较,模拟结果显示,对于复杂的QAM信号,URL-CMA算法比CMA算法在收敛速率、降低稳态均方误差和符号间干扰(ISI)等方面具有明显的优势,有效地改进了信道均衡性能。Based on the analysis of the disadvantages of traditional blind adaptive channel equalization CMA,this paper presents the underdetermined-order recursive least-squares constant modulus algorithm for blind channel equalization（URL-CMA）.In each step,the algorithm adds new data in a matrix form to increase the information of convergence.The performance of the proposed algorithm was compared with CMA by QAM signal in simulation.The result shows that the URL-CMA is superior and more robust in noise environments under multipath propagation channel and can effectively improve the channel equalization by increasing convergence rate and decreasing the mean square errors and inter-symbol interference（ISI）.

关 键 词：通信系统 盲信道均衡 恒模算法 CMA 

分 类 号：TN822[电子电信—信息与通信工程] TP216[自动化与计算机技术—检测技术与自动化装置]