期刊文献+

基于NCMA算法的递归步长多模盲均衡算法

A Recursive Step Multi-Modulus Algorithm for Blind Equalization Based on Normalized CMA
下载PDF
导出
摘要 为了解决传统常数模盲均衡算法收敛速度缓慢的问题,考虑到M-QAM信号模值分布在几个已知半径圆上的特点,该文给出了一种新的基于归一化常数模(NCMA)的递归步长多模盲均衡算法。这种算法能够自适应地调节步长,使收敛后的步长在达到最优的同时,得到的剩余稳态误差也达到最小。仿真实验表明,该算法能够在计算量增加不大的前提下,具有较好的收敛性能及抗误码性能,其收敛速度也得到较大的改善。 Considering the characteristic of the M - QAM signals which lies on several circles with known radius, this paper presents a new blind equalization algorithm which combines the benefits of the Normalized constant modulus algorithm (NCMA) and the recursive step multi - modulus algorithm. In respect that this algorithm can adjust step automatically, the ultimate step can reach an optimum value and remnant error can arrive at minimum value simultaneity. In addition, in order to speed up the convergence process, this algorithm can switch over to a Decision - Directed equalization scheme once the error level is reasonably low. The computer simulation results demonstrate fast convergence and satisfactory performance with these proposed algorithms.
作者 刘宁 王英民
出处 《计算机仿真》 CSCD 2006年第8期102-105,共4页 Computer Simulation
基金 国家自然科学基金资助项目(10474080)
关键词 盲均衡 递归步长 多模 双模式 Blind equalization Recursive step Multi - modulus Dual - mode
  • 相关文献

参考文献5

  • 1D N Godard.Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication Systems[J].IEEE Transaction on Communications,November 1980,28(11):1867-1875.
  • 2Kil Nam Oh,Yong Ohk Chin.Modified constant modulus algorithm:blind equalization and carrier phase recovery algorithm[J].IEEE International Conference on Communications,1995,1,com-28(11):498-502.
  • 3D L John.A Normalized Constant-Modulus Algorithm[C].Conference Record of the Twenty-Ninth Asilomar Conference on Signals,Systems and Computers,January 1995.694-697.
  • 4欧阳喜,葛临东.一种新的基于CMA算法的递归步长盲均衡算法[J].信息工程学院学报,1999,18(1):44-46. 被引量:6
  • 5徐金标,葛建华,王育民.基于CMA算法的双模式盲均衡算法[J].通信学报,1997,18(2):65-69. 被引量:16

二级参考文献3

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部