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 language | English |
|---|---|
| Article number | 5109632 |
| Pages (from-to) | 4942-4945 |
| Number of pages | 4 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 57 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - Dec 2009 |
| Externally published | Yes |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver