Date of this Version
Two modified blind equalization algorithms are analyzed for performance. These algorithms add a constellation-matched error term to the cost functions of the generalized Sato and multimodulus algorithms. The dynamic convergence behavior and steady-state performance of these algorithms, and of a related version of the constant modulus algorithm, are characterized. The analysis establishes the improved performance of the proposed algorithms.
blind equalisers, convergence, constant modulus algorithm, constellation-matched error term, constellation-matching, convergence analysis, dynamic convergence behavior, generalized Sato algorithm, modified blind equalization algorithms, multimodulus algorithms, Adaptive equalizer, blind equalization algorithms, convergence analysis
Date Posted: 01 June 2009
This document has been peer reviewed.