The Dithered Signed-Error Constant Modulus Algorithm
P. Schniter and C.R. Johnson, Jr.
Abstract
Adaptive blind equalization has gained widespread
use in communication systems that operate without training signals.
In particular, the Constant Modulus Algorithm (CMA) has become a
favorite of practitioners due to its LMS-like complexity and
desirable robustness properties. The desire for further reduction
in computational complexity has motivated signed-error versions of
CMA, which have been found to lack the robustness properties of
CMA. This paper presents a simple modification of signed error CMA,
based on the judicious use of dither, that results in an algorithm
with robustness properties closely resembling those of CMA. An
approximation to the steady-state mean-squared error performance of
the new algorithm is derived for comparison to that of CMA.
