A general form for recursive adaptive algorithms leading to an exact recursive CMA

A new derivation of recursive adaptive algorithms which leads to a general formulation of the updating equation is provided. After showing that the classical recursive least square (RLS) algorithm is a special case of this approach, it is shown that with some ad hoc approximations this formulation can be applied to the constant modulus (CM) criterion. The algorithm obtained is simulated in the mobile radio context and its performances are compared to those of other classical or more recent algorithms with a constant modulus criterion, showing a significant improvement in convergence rate and residual error