A comparison of three algorithms for blind equalization based on the constant modulus error criterion

Three constant modulus algorithms (CMA), the fast quasi-Newton CMA, the transform domain CMA, and the genetic search based CMA are proposed in this paper. The performances of these three algorithms are compared with each other via computer simulation. It is shown that the fast quasi-Newton CMA and the transform domain CMA achieve much faster convergence rate than the constant modulus algorithm based on the LMS algorithm. This fact shows that the whitening technique is not only useful but also necessary for the CMA.