Open Access
Translator Disclaimer
2013 Doubly Constrained Robust Blind Beamforming Algorithm
Xin Song, Jingguo Ren, Qiuming Li
J. Appl. Math. 2013(SI26): 1-8 (2013). DOI: 10.1155/2013/245609


We propose doubly constrained robust least-squares constant modulus algorithm (LSCMA) to solve the problem of signal steering vector mismatches via the Bayesian method and worst-case performance optimization, which is based on the mismatches between the actual and presumed steering vectors. The weight vector is iteratively updated with penalty for the worst-case signal steering vector by the partial Taylor-series expansion and Lagrange multiplier method, in which the Lagrange multipliers can be optimally derived and incorporated at each step. A theoretical analysis for our proposed algorithm in terms of complexity cost, convergence performance, and SINR performance is presented in this paper. In contrast to the linearly constrained LSCMA, the proposed algorithm provides better robustness against the signal steering vector mismatches, yields higher signal captive performance, improves greater array output SINR, and has a lower computational cost. The simulation results confirm the superiority of the proposed algorithm on beampattern control and output SINR enhancement.


Download Citation

Xin Song. Jingguo Ren. Qiuming Li. "Doubly Constrained Robust Blind Beamforming Algorithm." J. Appl. Math. 2013 (SI26) 1 - 8, 2013.


Published: 2013
First available in Project Euclid: 7 May 2014

zbMATH: 06950579
MathSciNet: MR3090618
Digital Object Identifier: 10.1155/2013/245609

Rights: Copyright © 2013 Hindawi


Vol.2013 • No. SI26 • 2013
Back to Top