The constant modulus algorithm (CMA) applied to a fractionally spaced equaliser, with length and zero constraints on the channel, has been shown to be globally convergent when there is no channel noise. However, in the presence of channel noise, the performance of the CMA can suffer because of the existence of undesired local minima corresponding to different delays. A new technique is introduced, based on the Gram-Schmidt orthogonalisation, to obtain convergence to an optimum delay where the mean square error is minimum
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
We propose a new family of mixed constant modulus algorithms for the elimination of local minima ass...
The constant modulus algorithm (CMA) applied to a fractionally spaced equaliser, with length and zer...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
A family of algorithms is presented for the adaptation of a fractionally spaced FIR channel equalise...
A family of algorithms is presented for the adaptation of a fractionally spaced FIR channel equalise...
The performance of the constant modulus algorithm can suffer because of the existence of local minim...
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 ...
The performance of the constant modulus algorithm can suffer because of the existence of local minim...
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
We propose a new family of mixed constant modulus algorithms for the elimination of local minima ass...
The constant modulus algorithm (CMA) applied to a fractionally spaced equaliser, with length and zer...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
We study the local minima relocation of the fractionally spaced constant modulus algorithm (FSE-CMA)...
A family of algorithms is presented for the adaptation of a fractionally spaced FIR channel equalise...
A family of algorithms is presented for the adaptation of a fractionally spaced FIR channel equalise...
The performance of the constant modulus algorithm can suffer because of the existence of local minim...
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 ...
The performance of the constant modulus algorithm can suffer because of the existence of local minim...
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
The constant modulus algorithm (CMA) is a popular blind equalization algorithm. A common device used...
We propose a new family of mixed constant modulus algorithms for the elimination of local minima ass...