Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29534


Select areas to restrict search in scientific publication database:
7096
Near-Field Robust Adaptive Beamforming Based on Worst-Case Performance Optimization
Abstract:
The performance of adaptive beamforming degrades substantially in the presence of steering vector mismatches. This degradation is especially severe in the near-field, for the 3-dimensional source location is more difficult to estimate than the 2-dimensional direction of arrival in far-field cases. As a solution, a novel approach of near-field robust adaptive beamforming (RABF) is proposed in this paper. It is a natural extension of the traditional far-field RABF and belongs to the class of diagonal loading approaches, with the loading level determined based on worst-case performance optimization. However, different from the methods solving the optimal loading by iteration, it suggests here a simple closed-form solution after some approximations, and consequently, the optimal weight vector can be expressed in a closed form. Besides simplicity and low computational cost, the proposed approach reveals how different factors affect the optimal loading as well as the weight vector. Its excellent performance in the near-field is confirmed via a number of numerical examples.
Digital Object Identifier (DOI):

References:

[1] J. Capon, "High resolution frequency-wavenumber spectrum analysis," Porc. IEEE, vol. 57, Aug. 1969, pp. 1408-1418.
[2] H. L. Van Trees, Detection, Estimation, and Modulation Theory, Part IV, Optimum Array Processing. New York: Wiley, 2002.
[3] Y. R. Zheng, R. A. Goubran, and M. EI-Tanany, "Robust near-field adaptive beamforming with distance discrimination," IEEE Trans. Signal Processing, vol. 12, no. 5, Sep. 2004, pp. 478-488.
[4] S. Doclo, M. Moonen, "Design a far-field and near-field broadband beamformers using eigenfilters," Signal Processing, vol. 83, no. 12, Dec. 2003, pp. 2641-2673.
[5] A. B. Gershman, "Robust adaptive beamforming: an overview of recent trends and advances in the field," in Proc. Int. Conf. Antenna Theory and Techniques, vol. 1, Sept. 2003, pp. 30-35.
[6] S. A. Vorobyov, A. B. Gershman, and Z. Luo, "Robust adaptive beamforming using worst-case performance optimization: a solution to the signal mismatch problem," IEEE Trans. Signal Processing, vol. 51, Feb. 2003, pp. 313-324.
[7] R. G. Lorenz, S. P. Boyd, "Robust minimum variance beamforming," IEEE Trans. Signal Processing, vol. 53, no. 5 May. 2005, pp. 1684-1696,.
[8] J. Li, P. Stoica, Z.-S. Whang, "On robust Capon beamforming and diagonal loading," IEEE Trans. Signal Processing, vol. 51, no. 7, July 2003, pp. 1702-1715.
[9] J. Li, P. Stoica, Z.-S. Wang, "Doubly constrained robust Capon beamformer," IEEE Trans. Signal Processing, vol. 52, no. 9, Sept. 2004, pp. 2407-2423.
[10] F. Vincent, O. Besson, "Steering vector errors and diagonal loading," IEE Proc. -Radar Sonar Navig., vol. 151, no. 6, Dec. 2004, pp. 337-343.
[11] O. Besson, F. Vincent, "Performance analysis of beamformers using generalized loading of the covariance matrix in the presence of random steering vector errors," IEEE Trans. Signal processing, vol. 53, no. 2, Feb. 2005, pp. 452-459.
[12] D. D. Feldman and L. J. Griffiths, "A projection approach to robust adaptive beamforming," IEEE Trans. Signal Processing, vol. 42, April, 1994, pp. 867-876.
[13] M. H. Er, A. Cantoni, "An alternative formulation for an optimum beamformer with robustness capability," Proc. Int. Elect. Eng. F, Commun., Radar, Signal Process., vol. 132, 1985, pp. 447-460.
[14] Z. Tian, K. L. Bell, H. L. Van Trees, "A recursive least squares implementation for LCMP beamforming under quadratic constraint," IEEE Trans. Signal Processing, vol. 49, no. 6, June, 2001, pp. 1138-1145.
Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007