TY - GEN
T1 - A modified dithered signed-error constant-modulus algorithm for blind adaptive equalizer
AU - Tawfik, A.
AU - Abdel-Raheem, E.
AU - Agathoklis, P.
PY - 2000
Y1 - 2000
N2 - Adaptive blind equalization has gained wide-spread use in communication receivers 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 (SE-CMA) which have been found to lack the robustness properties of CMA. Alternatively a dithered singed-error of CMA (DSE-CMA) based on the judicious use of dither, has been proposed which results in algorithm with robustness properties nearly identical to those of CMA with the cost of the degradation in steady-state mean square error (MSE) performance. This paper presents a modified dithered signed-error version of CMA (MDSE- CMA) which is motivated by a reduction of the steady-state MSE of DSE-CMA without increase in its computational complexity.
AB - Adaptive blind equalization has gained wide-spread use in communication receivers 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 (SE-CMA) which have been found to lack the robustness properties of CMA. Alternatively a dithered singed-error of CMA (DSE-CMA) based on the judicious use of dither, has been proposed which results in algorithm with robustness properties nearly identical to those of CMA with the cost of the degradation in steady-state mean square error (MSE) performance. This paper presents a modified dithered signed-error version of CMA (MDSE- CMA) which is motivated by a reduction of the steady-state MSE of DSE-CMA without increase in its computational complexity.
UR - https://www.scopus.com/pages/publications/15944427283
U2 - 10.1109/ICECS.2000.912971
DO - 10.1109/ICECS.2000.912971
M3 - Conference contribution
AN - SCOPUS:15944427283
SN - 0780365429
SN - 9780780365421
T3 - Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems
SP - 688
EP - 691
BT - ICECS 2000 - 7th IEEE International Conference on Electronics, Circuits and Systems
T2 - 7th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2000
Y2 - 17 December 2000 through 20 December 2000
ER -