Abstract
This paper uses the Hybrid Steepest Descent Method (HSDM) to design robust smart antennas. Several design criteria as well as robustness are mathematically described by a finite collection of closed convex sets in a real Euclidean space. Desirable beamformers are defined as points of the generalized convex feasible set which is well defined even in the case of inconsistent design criteria. A quadratic cost function is formed by the correlations of the incoming data, and the HSDM constructs a point sequence that (strongly) converges to the (unique) minimizer of the cost function over the generalized convex feasible set. Numerical examples validate the proposed design.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 4511-4522 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 55 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 2007 |
Bibliographical note
Funding Information:The authors would like to thank Dr. A. Georgiadis for the valuable comments on antennas and Dr. M. Fukuda for pointing out [34] and [35] and for the discussion on the computational complexity of interior point methods. The authors would also like to thank the anonymous reviewers who helped us improve the original manuscript. Finally, K. Slavakis is greatly indebted to the Japan Society for the Promotion of Science (JSPS) for supporting this work and his stay at the Tokyo Institute of Technology.
Keywords
- Convex feasibility problems
- Fixed point theory
- Hybrid steepest descent method
- Wideband beamforming