University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A constrained constant modulus algorithm based on uniform linear arrays

Zhang, L, Liu, W and Langley, RJ (2010) A constrained constant modulus algorithm based on uniform linear arrays In: 4th International Symposium on Communications, Control and Signal Processing (ISCCSP), 2010, 2010-03-03 - 2010-03-05, Limassol, Cyprus.

Full text not available from this repository.


A novel constant modulus algorithm (CMA) is proposed based on a uniformly spaced linear array by constraining its weight vector to a specific conjugate symmetric form. The constraint is derived from the beamformer with an optimum output signal to interference plus noise ratio (SINR). The effect of the additional constraint is equivalent to adding a second step to the original adaptive algorithm. With this constraint, the modified CMA will always generate a weight vector in the desired form for each update and the number of variables is effectively reduced by half, leading to a faster convergence rate and an improved SINR performance. The proposed idea is general and can be extended to many other variations of the standard CMA.

Item Type: Conference or Workshop Item (Conference Paper)
Subjects : Electronic Engineering
Divisions : Surrey research (other units)
Authors :
Liu, W
Langley, RJ
Date : June 2010
DOI : 10.1109/ISCCSP.2010.5463479
Copyright Disclaimer : © 2010 IEEE
Contributors :
Uncontrolled Keywords : Sensor arrays, Signal processing algorithms, Signal to noise ratio, Interference constraints, Vectors, Convergence, Narrowband, Process control, Communication system control, Array signal processing
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:58
Last Modified : 23 Jan 2020 19:00

Actions (login required)

View Item View Item


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