Search

The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Wein- stein 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. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel joint algorithm to estimate the symbol timing and carrier frequency offsets of wireless orthogonal frequency division multiplexing (OFDM) signals. To jointly estimate synchronization parameters using the maximum likelihood (ML) criterion, researchers have derived conventional models only from additive white Gaussian noise (AWGN) or single-path fading channels. We develop a general ML estimation algorithm that can accurately calculate symbol timing and carrier frequency offsets over a fast time-varying multipath channel. To reduce overall estimation complexity, the proposed scheme consists of two estimation stages: coarse and fine synchro nizations. A low complexity coarse synchronization based on the least-squares (LS) method can rapidly estimate the rough symbol timing and carrier frequency offsets over a fast time-varying multipath channel. The subsequent ML fine synchronization can then obtain accurate final results based on the previous coarse synchronization. Simulations demonstrate that the coarse-to-fine method provides a good tradeoff between estimation accuracy and computational complexity. [ABSTRACT FROM AUTHOR]