An Robust Adaptive Beamforming Algortihm based on Subspace Complement

DOI

10.2991/ifmca-16.2017.18How to use a DOI?

Keywords

Adaptive beamforming; Subspace complement; Prior information; Convex programming; Minimum variance distortionless response

Abstract

A novel algorithm for robust adaptive beamforming is put forward in this paper. This algorithm use the characteristic of complement of desired signal subspace complement to build constrained model and solve the supremum, then the solution based on convex programming are given in the paper .The two characteristics of the proposed algorithm are: on one hand, this algorithm does not need imprecise steering vector of desired signal and exact antenna array geometry; on the other hand, the presented algorithm has robustness for steering vector mismatches, antenna element displacement errors and other errors, and has better performance than existing algorithms. The simulation results show the effectiveness of the proposed algorithm. Due to the little prior information is needed; therefore, it is helpful to engineering application.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiang Zou
AU  - Zifa Zhong
AU  - Hui Liu
PY  - 2017/03
DA  - 2017/03
TI  - An Robust Adaptive Beamforming Algortihm based on Subspace Complement
BT  - Proceedings of the 2016 International Forum on Mechanical, Control and Automation (IFMCA 2016)
PB  - Atlantis Press
SP  - 118
EP  - 125
SN  - 2352-5401
UR  - https://doi.org/10.2991/ifmca-16.2017.18
DO  - 10.2991/ifmca-16.2017.18
ID  - Zou2017/03
ER  -