Mixed-norm constant modulus algorithm for channel equalization of wireless communication systems

Constant Modulus algorithm (CMA) has been widely used for blind channel equalization. The slow convergence speed of CMA has motivated us to propose a new method of updating filter coefficients based upon a mixing of Constant Modulus 2-2 (CM 2-2) and Constant Modulus 1-1 (CM 1-1) cost functions. It is shown that the proposed algorithm satisfies the Benveniste-Goursat-Ruget Theorem. Hence, under perfect blind equalization conditions, it guarantees that searching by the stochastic gradient descent method will lead to its minimum point. The performance of the algorithm is demonstrated in channel equalization of wireless communication systems.