Robust adaptive beamforming using sequential quadratic programming

Aboulnasr Hassanien; Sergiu Vorobyov; Kon Max Wong

doi:10.1109/ICASSP.2008.4518117

Robust adaptive beamforming using sequential quadratic programming

Aboulnasr Hassanien, Sergiu Vorobyov, Kon Max Wong

School of Engineering & Physical Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Pages	2345-2348
Number of pages	4
DOIs	https://doi.org/10.1109/ICASSP.2008.4518117
Publication status	Published - 2008
Event	33rd IEEE International Conference on Acoustics, Speech and Signal Processing 2008 - Las Vegas, NV, USA, Las Vegas, United States Duration: 30 Mar 2008 → 4 Apr 2008

Conference

Conference	33rd IEEE International Conference on Acoustics, Speech and Signal Processing 2008
Abbreviated title	ICASSP 2008
Country/Territory	United States
City	Las Vegas
Period	30/03/08 → 4/04/08

Keywords

Adaptive arrays
Array signal processing
Mathematical programming
Parameter estimation
Robustness

Access to Document

10.1109/ICASSP.2008.4518117

Cite this

@inproceedings{214d9f6d42ae4f84934fa1411715157b,

title = "Robust adaptive beamforming using sequential quadratic programming",

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. {\textcopyright}2008 IEEE.",

keywords = "Adaptive arrays, Array signal processing, Mathematical programming, Parameter estimation, Robustness",

author = "Aboulnasr Hassanien and Sergiu Vorobyov and Wong, {Kon Max}",

year = "2008",

doi = "10.1109/ICASSP.2008.4518117",

language = "English",

isbn = "1424414849",

pages = "2345--2348",

booktitle = "2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP",

note = "33rd IEEE International Conference on Acoustics, Speech and Signal Processing 2008, ICASSP 2008 ; Conference date: 30-03-2008 Through 04-04-2008",

}

Hassanien, A, Vorobyov, S & Wong, KM 2008, Robust adaptive beamforming using sequential quadratic programming. in 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. pp. 2345-2348, 33rd IEEE International Conference on Acoustics, Speech and Signal Processing 2008, Las Vegas, United States, 30/03/08. https://doi.org/10.1109/ICASSP.2008.4518117

TY - GEN

T1 - Robust adaptive beamforming using sequential quadratic programming

AU - Hassanien, Aboulnasr

AU - Vorobyov, Sergiu

AU - Wong, Kon Max

PY - 2008

Y1 - 2008

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

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

KW - Adaptive arrays

KW - Array signal processing

KW - Mathematical programming

KW - Parameter estimation

KW - Robustness

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

U2 - 10.1109/ICASSP.2008.4518117

DO - 10.1109/ICASSP.2008.4518117

M3 - Conference contribution

SN - 1424414849

SN - 9781424414840

SP - 2345

EP - 2348

BT - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP

T2 - 33rd IEEE International Conference on Acoustics, Speech and Signal Processing 2008

Y2 - 30 March 2008 through 4 April 2008

ER -

Robust adaptive beamforming using sequential quadratic programming

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this