基于集员滤波和数据重用的CMA盲均衡算法  

CMS blind equalization with set-membership and data-reusing

作　　者：刘世刚[1] 葛临东[1] 巩克现[1] 

机构地区：[1]解放军信息工程大学信息工程学院,郑州450002

出　　处：《吉林大学学报（工学版）》2009年第6期1677-1682,共6页Journal of Jilin University:Engineering and Technology Edition

基　　金：河南省自然科学基金项目(0611051400)

摘　　要：提出了一种适用于突发信号的CMA盲均衡算法。该算法基于集员滤波和数据重用思想,在集员约束集中采用仿射投影的思想,设置多个约束集,其个数与数据重用的长度相同。新算法大大提高了CMA算法的收敛速率,同时由于集员滤波思想的应用,超量均方误差也能维持在一个相对较低的水平,适用于突发信号的盲均衡。文中详细描述了新算法的推导过程,并就其性能进行了理论分析。在最后的数据仿真中,与基本CMA等算法在收敛速率、稳态误差等方面进行了对比分析,验证了新算法的有效性。A novel constant modulus blind equalization algorithm（CMA） with accelerated convergence is proposed.It is based on the concepts of set-membership and data-reusing.Applying the idea of affine projection,the algorithm includes many constraint sets,whose number is equal to the length of data-reusing.Compared with basic CMA,the convergence rate of the proposed algorithm is significantly faster;meanwhile,the excess mean square error can be maintained in a relatively low level because of the idea of set-membership.Deriving details of the algorithm are presented and its performance is analyzed theoretically.The convergence rate and stational error of the proposed algorithm are compared with those of other constant modulus algorithms by computer simulation.

关 键 词：通信技术 集员滤波 仿射投影 数据重用 CMA 

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