## Robust minimum variance beamforming (2005)

### Cached

### Download Links

- [www.stanford.edu]
- [stanford.edu]
- [www.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Transactions on Signal Processing |

Citations: | 62 - 10 self |

### BibTeX

@ARTICLE{Lorenz05robustminimum,

author = {Robert G. Lorenz and Stephen P. Boyd},

title = {Robust minimum variance beamforming},

journal = {IEEE Transactions on Signal Processing},

year = {2005},

volume = {53},

pages = {1684--1696}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract—This paper introduces an extension of minimum variance beamforming that explicitly takes into account variation or uncertainty in the array response. Sources of this uncertainty include imprecise knowledge of the angle of arrival and uncertainty in the array manifold. In our method, uncertainty in the array manifold is explicitly modeled via an ellipsoid that gives the possible values of the array for a particular look direction. We choose weights that minimize the total weighted power output of the array, subject to the constraint that the gain should exceed unity for all array responses in this ellipsoid. The robust weight selection process can be cast as a second-order cone program that can be solved efficiently using Lagrange multiplier techniques. If the ellipsoid reduces to a single point, the method coincides with Capon’s method. We describe in detail several methods that can be used to derive an appropriate uncertainty ellipsoid for the array response. We form separate uncertainty ellipsoids for each component in the signal path (e.g., antenna, electronics) and then determine an aggregate uncertainty ellipsoid from these. We give new results for modeling the element-wise products of ellipsoids. We demonstrate the robust beamforming and the ellipsoidal modeling methods with several numerical examples. Index Terms—Ellipsoidal calculus, Hadamard product, robust beamforming, second-order cone programming.