Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (34): 150-152.

• 网络、通信与安全 • Previous Articles     Next Articles

Computationally efficient multi-modulus blind equalization algorithms

LIU Feng,GE Lin-dong   

  1. Institute of Information Engineering,Information Engineering University of PLA,Zhengzhou 450002,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-12-01 Published:2007-12-01
  • Contact: LIU Feng

计算有效的多模盲均衡算法

刘 锋,葛临东   

  1. 解放军信息工程大学 信息工程学院,郑州 450002
  • 通讯作者: 刘 锋

Abstract: The desire for further reduction in computational complexity has motivated quantized-error version of Multi-Modulus Algorithm(MMA).A class of computationally efficient multi-modulus blind equalization algorithms are presented.The Signed-Error Multi-Modulus Algorithm(SE-MMA),based on the use of signed-error,has lower computational complexity.In order to enhance the robustness properties of SE-MMA,a Dithered Signed-Error of MMA(DSE-MMA) based on the judicious use of dither,is pro-posed which results in an algorithm with robustness property closely resembling those of MMA with the cost of the degradation in steady-state Mean Square Error(MSE).Then a variable step-size version of DSE-MMA is presented,which has faster convergence speed and lower steady-state MSE.The performance of these algorithms are evaluated via simulations and have shown to have excellent performance as compared to the MMA,with substantially less complexity.

Key words: blind equalization, dithered signed-error algorithm, multi-modulus algorithm, variable step-size, computational complexity

摘要: 为了进一步降低多模盲均衡算法的计算复杂度,研究了一类计算有效的量化误差多模算法。符号误差多模算法对误差信号取符号操作,降低了计算复杂度,易于硬件实现。采用抖动量化技术可以进一步提高符号算法的鲁棒性,但稳态均方误差性能有所下降。利用变步长策略的变步长抖动符号误差算法不仅收敛速率快,而且具有低稳态均方误差值。仿真结果验证了这三种算法的特性。

关键词: 盲均衡, 抖动符号误差算法, 多模算法, 变步长, 计算复杂度