Low-Complexity Constant Modulus Algorithms for Blind Beamforming Based on Symmetrically Distributed Arrays

Zhang, L. , Liu, W. and Langley, R. J. (2011) Low-Complexity Constant Modulus Algorithms for Blind Beamforming Based on Symmetrically Distributed Arrays. In: 2011 IEEE Statistical Signal Processing Workshop (SSP), Nice, France, 28-30 Jun 2011, pp. 385-388. ISBN 9781457705694 (doi: 10.1109/SSP.2011.5967711)

Abstract

A class of low-complexity constant modulus (CM) algorithms with real-valued coefficients is proposed based on symmetrically distributed arrays (SDAs) by introducing a preprocessing transformation matrix. It is derived from the beamformer with a minimum mean square error (MSE) and three representative CMAs are studied including the basic CMA, least-squares CMA (LSCMA) and the recursive-least-squares CMA (RLSCMA). With the preprocessing matrix, the computational complexity of the overall system is reduced significantly; moreover, a faster convergence speed is achieved and given the same stepsize, the system arrives at a lower MSE. Simulation results are provided to verify the effectiveness of the proposed approach.

• Item Type: Conference Proceedings
• Keywords: Array signal processing, computational complexity, matrix algebra, mean square error methods, MSE, blind beamforming, computational complexity, low-complexity constant modulus algorithms, minimum mean square error, preprocessing transformation matrix, real-valued coefficients, recursive-least-squares CMA, symmetrically distributed arrays, antennas, computational complexity, convergence, optimized production technology, signal processing algorithms, signal to noise ratio.
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Zhang, Professor Lei
• Authors: Zhang, L., Liu, W., and Langley, R. J.
• College/School: College of Science and Engineering > School of Engineering
• ISSN: 2373-0803
• ISBN: 9781457705694