Análise estatística do algoritmo Shalvi–Weinstein

Renato Candido, Magno T. M. Silva, Vítor H. Nascimento, Maria D. Miranda. Análise estatística do algoritmo Shalvi–Weinstein. In: Simpósio Brasileiro de Telecomunicações – SBrT’2009, 2009, Blumenau. Anais do SBrT 2009, 2009, pp.1–6 (available only in portuguese).


Blind equalization algorithms with good convergence and tracking properties, and numerical robustness are desirable to ensure the good performance of a communications system. Recently was proposed a version of the Shalvi-Weinstein algorithm (SWA) which avoids divergence and has a reduced computational cost. In this paper, we present steady-state and transient analyses for this algorithm. Besides some classical assumptions used in the analysis of adaptive filters, such as the independence theory, we consider some recent models proposed to analyze the constant modulus algorithm (CMA). Good agreement between analytical and simulation results is observed.


Adaptive filters, Blind equalization, Shalvi-Weinstein algorithm, Statistical analysis, Tracking analysis.