Robust adaptive beamforming using sequential quadratic programming

Aboulnasr Hassanien, Sergiu Vorobyov, Kon Max Wong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed steering vectors and to use this difference to correct the erroneous presumed steering vector. The estimation process is performed iteratively where a quadratic convex optimization problem is solved at each iteration. Unlike other robust beam-forming techniques, our algorithm does not assume that the norm of the mismatch vector is upper bounded, and hence it does not suffer from the negative effects of over/under estimation of the upper bound. Simulation results show the effectiveness of the proposed algorithm. ©2008 IEEE.

Original languageEnglish
Title of host publication2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Pages2345-2348
Number of pages4
DOIs
Publication statusPublished - 2008
Event33rd IEEE International Conference on Acoustics, Speech and Signal Processing 2008 - Las Vegas, NV, USA, Las Vegas, United States
Duration: 30 Mar 20084 Apr 2008

Conference

Conference33rd IEEE International Conference on Acoustics, Speech and Signal Processing 2008
Abbreviated titleICASSP 2008
CountryUnited States
CityLas Vegas
Period30/03/084/04/08

Keywords

  • Adaptive arrays
  • Array signal processing
  • Mathematical programming
  • Parameter estimation
  • Robustness

Fingerprint Dive into the research topics of 'Robust adaptive beamforming using sequential quadratic programming'. Together they form a unique fingerprint.

Cite this