Attraction of saddles and slow convergence in CMA adaptation

Lambotharan, S, Chambers, J and Johnson, CR (1997) Attraction of saddles and slow convergence in CMA adaptation Signal Processing, 59 (3). pp. 335-340.

Full text not available from this repository.

Abstract

We show that the most widely used blind equalization algorithm, the constant modulus algorithm, CMA, can be attracted during one convergence trajectory to the vicinity of more than one of the saddles in its error performance surface where it exhibits very slow convergence. We also establish bounds on the attraction and escape rates at a saddle and show that the saddles associated with lower energy levels have slower escape rates than the saddles with higher energy levels. These results highlight the need for intelligent initialization schemes for the CMA algorithm. We suggest a step normalisation technique to improve convergence speed in the vicinity of a saddle. © 1997 Elsevier Science B.V.

Item Type:	Article
Divisions :	Surrey research (other units)
Authors :	Name Email ORCID Lambotharan, S Chambers, J j.a.chambers@surrey.ac.uk Johnson, CR
Date :	1 June 1997
Depositing User :	Symplectic Elements
Date Deposited :	17 May 2017 13:27
Last Modified :	24 Jan 2020 23:58
URI:	http://epubs.surrey.ac.uk/id/eprint/839294

Actions (login required)

View Item

Downloads