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

Zhang, L, Liu, W and Langley, RJ (2010) A class of constant modulus algorithms for uniform linear arrays with a conjugate symmetric constraint Signal Processing, 90 (9). pp. 2760-2765.

Full text not available from this repository.

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:	Article
Subjects :	Electronic Engineering
Divisions :	Surrey research (other units)
Authors :	Name Email ORCID Zhang, L lei.zhang@surrey.ac.uk Liu, W Langley, RJ
Date :	September 2010
DOI :	10.1016/j.sigpro.2010.04.003
Copyright Disclaimer :	© 2010 Elsevier B.V. All rights reserved.
Uncontrolled Keywords :	Constant modulus, Uniform linear arrays, Conjugate symmetric, Blind beamforming
Depositing User :	Symplectic Elements
Date Deposited :	17 May 2017 13:58
Last Modified :	25 Jan 2020 00:35
URI:	http://epubs.surrey.ac.uk/id/eprint/841007

Actions (login required)

View Item

Downloads