University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Leaky constant modulus algorithms: Sensitivity of local minima

Lambotharan, S, Chambers, JA and Constantinides, AG (1999) Leaky constant modulus algorithms: Sensitivity of local minima IEEE Transactions on Signal Processing, 47 (1).

Full text not available from this repository.

Abstract

We examine the behavior of the leaky constant modulus algorithm (L-CMA), which is a special case of the recently proposed minimum equalizer norm constant modulus algorithm (MEN-CMA). LCMA is shown to minimize a combination of the intersymbol interference (ISI) introduced by the channel and the noise amplification factor of the equalizer. Some local minima of the standard (MA cost function that cause large noise amplification for a fractionally spaced equalizer can be eliminated. We also identify a class of channels for which L-CMA performs poorly as a consequence of the minima of the L-CMA cost function forming in the neighborhood of certain saddle points of the CMA cost function, particularly when the eigenvalue spread increases. This contradicts the conventional thinking that the performance advantage of L-CMA will improve with increased eigenvalue spread of the channel. © 1999 IEEE.

Item Type: Article
Authors :
NameEmailORCID
Lambotharan, SUNSPECIFIEDUNSPECIFIED
Chambers, JAj.a.chambers@surrey.ac.ukUNSPECIFIED
Constantinides, AGUNSPECIFIEDUNSPECIFIED
Date : 1 December 1999
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:27
Last Modified : 17 May 2017 13:27
URI: http://epubs.surrey.ac.uk/id/eprint/839277

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800