The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Weinstein algorithm (SWA). It is well-known that SWA presents a higher convergence rate than CMA, at the expense of higher computational complexity. If the forgetting factor is not sufficiently close to one, if the initialization is distant from the optimal solution, or if the signal-to-noise ratio is low, SWA can converge to undesirable local minima or even diverge. In this paper, we show that divergence can be caused by an inconsistency in the nonlinear estimate of the transmitted signal, or (when the algorithm is implemented in finite precision) by the loss of positiveness of the estimate of the autocorrelation matrix, or by a combination of both. In order to avoid the first cause of divergence, we propose a dual-mode SWA. In the first mode of operation, the new algorithm works as SWA; in the second mode, it rejects inconsistent estimates of the transmitted signal. Assuming the persistence of excitation condition, we present a deterministic stability analysis of the new algorithm. To avoid the second cause of divergence, we propose a dual-mode lattice SWA, which is stable even in finite-precision arithmetic, and has a computational complexity that increases linearly with the number of adjustable equalizer coefficients. The good performance of the proposed algorithms is confirmed through numerical simulations.
1 January 1997 in IEEE Transactions on Signal Processing
This paper presents a new minimal and backward stable QR-LSL algorithm obtained through the proper interpretation of the system matrix that describes the adaptation and filtering operations of QR-RLS algorithms. The new algorithm is based on a priori prediction errors normalized by the a posteriori prediction error energy-as suggested by the interpretation of the system matrix-and uses the fact that the latter quantities can be computed via a lattice structure. Backward consistency and backward stability become guaranteed under simple numerical conventions. In contrast with the known a posteriori QR-LSL algorithm, the new algorithm present; fewer numerical complexity, and backward consistency is guaranteed without the constraint of passive rotations in the recursive lattice section. Furthermore, reordering of some operations results in a version with identical numerical behavior and inherent parallelism that can be exploited for fast implementations. Both a priori and a posteriori QR-LSL algorithms are compared by means of simulations. For small mantissa wordlengths and forgetting factors λ not too close to 1, the proposed algorithm performs better due to dispensing with passive rotations. For forgetting factors very close to one and small wordlengths, both algorithms are sensitive to the accuracy of some well-identified computations
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which generally provides a relatively low misadjustment. Besides presenting strategies to speed up their convergences, we provide sufficient conditions for the stability of the symbol-based decision algorithm, which is an extension of the decision-directed algorithm. Their behaviors are illustrated through simulation results.
1 January 2018 in Journal of the Franklin Institute
One of the most popular algorithms for blind equalization is the constant modulus algorithm (CMA), due to its simplicity and low computational cost. However, if the step-size is not properly chosen or if the initialization is distant from the optimal solution, CMA can diverge or converge to undesirable local minima. In order to avoid divergence, we propose a dual-mode algorithm, which works as CMA with a time-variant step-size, but rejects non-consistent estimates of the transmitted signal. We present a deterministic analysis of the stability of the new algorithm for scalar filters. In the vector case, the good performance of the new algorithm is confirmed through numerical simulations.