Fast Constant Modulus Algorithm Based on Exponential Variable Segment Error Function

Author(s):  
Wei Rao ◽  
Huijun Xu ◽  
Yecai Guo
2013 ◽  
Vol 658 ◽  
pp. 537-540
Author(s):  
Sun Shouyu

The constant modulus algorithm (CMA) equalizer is perhaps the best known and the most popular scheme for blind adaptive channel equalization. In this paper, a modified constant modulus algorithm (modified CMA or MCMA) is proposed by modifying its error function. We have discussed the MCMA to blind channel equalization for baud-rat sampling in single-user case. Computer simulations are provided for 8PSK signals in noise environments under frequency selective channels. Results demonstrate that the MCMA displays much superior performance to the CMA for both convergence-time and intersymbol interference (ISI) or mean square error (MSE).


2014 ◽  
Vol 631-632 ◽  
pp. 824-829
Author(s):  
Emmanuel Anania Mwangosi ◽  
Cang Yan ◽  
Naveed Ur Rehman

The paper present new approach for improving the steady-state error performance of Constant Modulus Algorithm (CMA), it is well known that for higher level modulations such as QAM, CMA does not perform well. Several techniques have been proposed in recent years to deal with slow convergence and MSE performance of CMA. Constellation matched error has been seen to offer best performance by providing the cost function with the knowledge of the constellation symbols. New constellation match error function is studied, simulation is performed, it can be witnessed that 4dB improvement stead state error performance.


2011 ◽  
Vol 66-68 ◽  
pp. 1579-1585
Author(s):  
Qiao Xi Zhou ◽  
Ye Cai Guo

To improve equalization performance of the constant modulus algorithm (CMA), we study that error functions have an influence on the performance of the algorithm in this paper. Aiming at the character of different error functions, a new style of error function weighted by a variable coefficient is proposed. And a new CMA based on the new error function (VCMA) is proposed too. Because of variable-coefficient adjustability, the value of this new error function can become larger at the beginning of iteration and smaller at the end of iteration in the new algorithm. From gradient descent method, VCMA can have faster convergence rate and lower residual error than the CMA. Both theoretical analysis and experimental results have shown the effectiveness of the proposed algorithm.


Author(s):  
Tongtong Xu ◽  
Zheng Xiang

In this work, modified constant modulus algorithm based on bat algorithm is proposed for wireless sensor communications systems. The bat algorithm is a swarm intelligence optimization algorithm, which mainly used to solve optimization problems. The proposed algorithm focused on modified constant modulus algorithm, which is also applicable to the constant modulus algorithm. The error function of blind equalization algorithm is used as the evaluation function of the bat algorithm, and then the initial value of the weight vector is calculated adaptively by the bat algorithm. Theoretical analysis is provided to illustrate that the proposed algorithm has a faster convergence speed than the original one and is suitable for almost all blind channel equalization algorithms. The simulation results support the newly proposed improved algorithm. The proposed algorithm could be applied to some more complex wireless channel environments to improve the reception performance of sensor communication systems.


Sign in / Sign up

Export Citation Format

Share Document