A class of constant modulus algorithms for uniform linear arrays with a conjugate symmetric constraint

Zhang, L., Liu, W. and Langley, R. J. (2010) A class of constant modulus algorithms for uniform linear arrays with a conjugate symmetric constraint. Signal Processing, 90(9), pp. 2760-2765. (doi:10.1016/j.sigpro.2010.04.003)

Full text not currently available from Enlighten.

Abstract

A class of constant modulus algorithms (CMAs) subject to a conjugate symmetric constraint is proposed for blind beamforming based on the uniform linear array structure. 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 algorithms. The proposed approach is general and can be applied to both the traditional CMA and its all kinds of variants, such as the linearly constrained CMA (LCCMA) and the least squares CMA (LSCMA) as two examples. With this constraint, the modified CMAs will always generate a weight vector in the desired form for each update and the number of adaptive variables is effectively reduced by half, leading to a much improved overall performance.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Zhang, Dr Lei
Authors: Zhang, L., Liu, W., and Langley, R. J.
College/School:College of Science and Engineering > School of Engineering
Journal Name:Signal Processing
Publisher:Elsevier
ISSN:0165-1684
ISSN (Online):1872-7557
Published Online:09 April 2010

University Staff: Request a correction | Enlighten Editors: Update this record