Skip to main navigation Skip to search Skip to main content

On low complexity robust beamforming with positive semidefinite constraints

  • Chengwen Xing*
  • , Shaodan Ma
  • , Yik Chung Wu
  • *Corresponding author for this work
  • The University of Hong Kong

Research output: Contribution to journalArticlepeer-review

Abstract

This paper addresses the problem of robust beamforming for general-rank signal models with norm bounded uncertainties in the desired and received signal covariance matrices as well as positive semidefinite constraints on the covariance matrices. Two novel minimum variance robust beamformers are derived in closed-form. The first one basically is the closed-form version of an existing iterative algorithm, while the second one offers even better performance with respect to the first one. Both of them have the advantage of low complexity. The effectiveness and performance improvement of the proposed beamformers are verified by simulation results.

Original languageEnglish
Article number5109632
Pages (from-to)4942-4945
Number of pages4
JournalIEEE Transactions on Signal Processing
Volume57
Issue number12
DOIs
Publication statusPublished - Dec 2009
Externally publishedYes

Keywords

  • Convex optimization
  • Minimax
  • Positive semidefinite constraint
  • Robust beamforming

Fingerprint

Dive into the research topics of 'On low complexity robust beamforming with positive semidefinite constraints'. Together they form a unique fingerprint.

Cite this