The performance of the constant modulus algorithm can suffer because of the existence of local minima with large mean squared error (MSE). The paper presents a new method to obtain the optimum MSE over all delays using a second equalizer with a mixed constant modulus and crosscorrelation algorithm (CM-CCA). Proof of convergence is obtained for the noiseless case for a general symbol constellation. Simulations support the potential of the method even in noisy environments
To solve the problem of joint blind equalization and source separation, two new quasi-Newton adaptiv...
To solve the problem of joint blind equalization and source separation, two new quasi-Newton adaptiv...
In this work, a new algorithm, based on the minimum-disturbance principle with relaxation, is presen...
The performance of the constant modulus algorithm can suffer because of the existence of local minim...
The constant modulus algorithm (CMA) applied to a fractionally spaced equaliser, with length and zer...
The constant modulus algorithm (CMA) applied to a fractionally spaced equaliser, with length and zer...
The cross-correlation and constant modulus algorithm (CC-CMA) has been proven to be an effective app...
We examine the behavior of the leaky constant modulus algorithm (L-CMA), which is a special case of ...
We examine the behavior of the leaky constant modulus algorithm (L-CMA), which is a special case of ...
This work introduces an adaptive equalizer, namely the multi-constant modulus algorithm (MCMA), for...
The vector constant modulus algorithm (VCMA) was recently introduced as an ex-tension of CMA which c...
Another contribution is the proposal of an upper bound for the CM cost function based on the mean fo...
Abstract—In this paper, we propose an equalization algorithm for M-PSK constellations that greatly i...
We address the problem of blind recovery of multiple sources from their linear convolutive mixture w...
This paper presents a new class of blind equalization algorithms for PAM or QAM data transmission ov...
To solve the problem of joint blind equalization and source separation, two new quasi-Newton adaptiv...
To solve the problem of joint blind equalization and source separation, two new quasi-Newton adaptiv...
In this work, a new algorithm, based on the minimum-disturbance principle with relaxation, is presen...
The performance of the constant modulus algorithm can suffer because of the existence of local minim...
The constant modulus algorithm (CMA) applied to a fractionally spaced equaliser, with length and zer...
The constant modulus algorithm (CMA) applied to a fractionally spaced equaliser, with length and zer...
The cross-correlation and constant modulus algorithm (CC-CMA) has been proven to be an effective app...
We examine the behavior of the leaky constant modulus algorithm (L-CMA), which is a special case of ...
We examine the behavior of the leaky constant modulus algorithm (L-CMA), which is a special case of ...
This work introduces an adaptive equalizer, namely the multi-constant modulus algorithm (MCMA), for...
The vector constant modulus algorithm (VCMA) was recently introduced as an ex-tension of CMA which c...
Another contribution is the proposal of an upper bound for the CM cost function based on the mean fo...
Abstract—In this paper, we propose an equalization algorithm for M-PSK constellations that greatly i...
We address the problem of blind recovery of multiple sources from their linear convolutive mixture w...
This paper presents a new class of blind equalization algorithms for PAM or QAM data transmission ov...
To solve the problem of joint blind equalization and source separation, two new quasi-Newton adaptiv...
To solve the problem of joint blind equalization and source separation, two new quasi-Newton adaptiv...
In this work, a new algorithm, based on the minimum-disturbance principle with relaxation, is presen...