Low-complexity constant modulus algorithms for blind beamforming based on symmetrically distributed arrays

Lei Zhang; Wei Liu; Richard J. Langley

doi:10.1109/SSP.2011.5967711

Low-complexity constant modulus algorithms for blind beamforming based on symmetrically distributed arrays

Lei Zhang, Wei Liu, Richard J. Langley

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

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.

Original language	English
Title of host publication	2011 IEEE Statistical Signal Processing Workshop, SSP 2011
Pages	385-388
Number of pages	4
DOIs	https://doi.org/10.1109/SSP.2011.5967711
Publication status	Published - Jul 2011
Event	2011 IEEE Statistical Signal Processing Workshop, SSP 2011 - Nice, France Duration: 28 Jun 2011 → 30 Jun 2011

Publication series

Name	IEEE Workshop on Statistical Signal Processing Proceedings

Conference

Conference	2011 IEEE Statistical Signal Processing Workshop, SSP 2011
Country/Territory	France
City	Nice
Period	28/06/11 → 30/06/11

ASJC Scopus subject areas

Electrical and Electronic Engineering
Applied Mathematics
Signal Processing
Computer Science Applications

More information

10.1109/SSP.2011.5967711

Cite this

@inproceedings{c9190ffafc074e69849c718eadf470ea,

title = "Low-complexity constant modulus algorithms for blind beamforming based on symmetrically distributed arrays",

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.",

author = "Lei Zhang and Wei Liu and Langley, {Richard J.}",

year = "2011",

month = jul,

doi = "10.1109/SSP.2011.5967711",

language = "English",

isbn = "9781457705700",

series = "IEEE Workshop on Statistical Signal Processing Proceedings",

pages = "385--388",

booktitle = "2011 IEEE Statistical Signal Processing Workshop, SSP 2011",

note = "2011 IEEE Statistical Signal Processing Workshop, SSP 2011 ; Conference date: 28-06-2011 Through 30-06-2011",

}

Zhang, L, Liu, W & Langley, RJ 2011, Low-complexity constant modulus algorithms for blind beamforming based on symmetrically distributed arrays. in 2011 IEEE Statistical Signal Processing Workshop, SSP 2011., 5967711, IEEE Workshop on Statistical Signal Processing Proceedings, pp. 385-388, 2011 IEEE Statistical Signal Processing Workshop, SSP 2011, Nice, France, 28/06/11. https://doi.org/10.1109/SSP.2011.5967711

Low-complexity constant modulus algorithms for blind beamforming based on symmetrically distributed arrays. / Zhang, Lei; Liu, Wei; Langley, Richard J.
2011 IEEE Statistical Signal Processing Workshop, SSP 2011. 2011. p. 385-388 5967711 (IEEE Workshop on Statistical Signal Processing Proceedings).

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Low-complexity constant modulus algorithms for blind beamforming based on symmetrically distributed arrays

AU - Zhang, Lei

AU - Liu, Wei

AU - Langley, Richard J.

PY - 2011/7

Y1 - 2011/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80052199894&partnerID=8YFLogxK

U2 - 10.1109/SSP.2011.5967711

DO - 10.1109/SSP.2011.5967711

M3 - Conference article published in proceeding or book

AN - SCOPUS:80052199894

SN - 9781457705700

T3 - IEEE Workshop on Statistical Signal Processing Proceedings

SP - 385

EP - 388

BT - 2011 IEEE Statistical Signal Processing Workshop, SSP 2011

T2 - 2011 IEEE Statistical Signal Processing Workshop, SSP 2011

Y2 - 28 June 2011 through 30 June 2011

ER -

Low-complexity constant modulus algorithms for blind beamforming based on symmetrically distributed arrays

Abstract

Publication series

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this