The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Robust adaptive beamforming using worst-case performance optimization: a solution to the signal mismatch problem
Abstract
Adaptive beamforming methods are known to degrade if some of underlying assumptions on the environment, sources, or sensor array become violated. In particular, if the desired signal is present in training snapshots, the adaptive array performance may be quite sensitive even to slight mismatches between the presumed and actual signal steering vectors (spatial signatures). Such mismatches can occur as a result of environmental nonstationarities, look direction errors, imperfect array calibration, distorted antenna shape, as well as distortions caused by medium inhomogeneities, near-far mismatch, source spreading, and local scattering. The similar type of performance degradation can occur when the signal steering vector is known exactly but the training sample size is small. In this paper, we develop a new approach to robust adaptive beamforming in the presence of an arbitrary unknown signal steering vector mismatch. Our approach is based on the optimization of worst-case performance. It turns out that the natural formulation of this adaptive beamforming problem involves minimization of a quadratic function subject to infinitely many nonconvex quadratic constraints. We show that this (originally intractable) problem can be reformulated in a convex form as the so-called second-order cone (SOC) program and solved efficiently (in polynomial time) using the well-established interior point method. It is also shown that the proposed technique can be interpreted in terms of diagonal loading where the optimal value of the diagonal loading factor is computed based on the known level of uncertainty of the signal steering vector. Computer simulations with several frequently encountered types of signal steering vector mismatches show better performance of our robust beamformer as compared with existing adaptive beamforming algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Rapid Convergence Rate in Adaptive Arrays
Reed, I. S., Mallett, J. D., & Brennan, L. E. (1974) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.1974.307893 · Cited by 2,203
An alternative approach to linearly constrained adaptive beamforming
Griffiths, L., & Jim, C. (1982) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1982.1142739 · Cited by 1,783
Cox, H., Zeskind, R., & Owen, M. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165054 · Cited by 1,681
Robust minimum variance beamforming
Lorenz, R. G., & Boyd, S. P. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.845436 · Cited by 774
Decoupled estimation of DOA and angular spread for a spatially distributed source
Besson, O., & Stoica, P. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.847774 · Cited by 225
Minimum variance beamforming with soft response constraints
Veen, B. D. V. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.134429 · Cited by 97
Inherent limitations in the localization of a coherently scattered source
Goldberg, J., & Messer, H. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.735321 · Cited by 40
Cited by
On robust Capon beamforming and diagonal loading
Li, J., Stoica, P., & Wang, Z. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.812831 · Cited by 1,439
Transmit beamforming for physical-layer multicasting
Sidiropoulos, N. D., Davidson, T. N., & Luo, Z.-Q. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872578 · Cited by 1,335
Self-citationRobust minimum variance beamforming
Lorenz, R. G., & Boyd, S. P. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.845436 · Cited by 774
Convex Optimization-Based Beamforming
Gershman, A., Sidiropoulos, N., Shahbazpanahi, S., Bengtsson, M., & Ottersten, B. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936015 · Cited by 571
Self-citationA Consolidated Perspective on Multimicrophone Speech Enhancement and Source Separation
Gannot, S., Vincent, E., Markovich-Golan, S., & Ozerov, A. (2017) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2016.2647702 · Cited by 563
An introduction to convex optimization for communications and signal processing
Luo, Z.-Q., & Yu, W. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879347 · Cited by 562
“Interestingly, by exploiting the phase ambiguity in w and using the same transformation outlined above, we can show [34] that (57) is equivalent to the following convex optimization problem (SOCP):”
MethodSelf-citationConvex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Phased-MIMO Radar: A Tradeoff Between Phased-Array and MIMO Radars
Hassanien, A., & Vorobyov, S. A. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2043976 · Cited by 476
Self-citationA Robust and Efficient Algorithm for Coprime Array Adaptive Beamforming
Zhou, C., Gu, Y., He, S., & Shi, Z. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2704610 · Cited by 382
Robust Beamforming for Wireless Information and Power Transmission
Xiang, Z., & Tao, M. (2012) · IEEE Wireless Communications Letters · doi:10.1109/wcl.2012.053112.120212 · Cited by 354
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Space‐Time Processing for MIMO Communications
(2005) · Wiley eBooks · doi:10.1002/0470010045 · Cited by 319
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
Principles of minimum variance robust adaptive beamforming design
Vorobyov, S. A. (2013) · Signal Processing · doi:10.1016/j.sigpro.2012.10.021 · Cited by 295
Self-citationDistributed Robust Multicell Coordinated Beamforming With Imperfect CSI: An ADMM Approach
Shen, C., Chang, T.-H., Wang, K.-Y., Qiu, Z., & Chi, C.-Y. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2188719 · Cited by 282
Pascual-Iserte, A., Palomar, D. P., Perez-Neira, A. I., & Lagunas, M. A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.861084 · Cited by 281
Metadata
- Authors
- Vorobyov, S. A., Gershman, A. B., & Luo, Z.-Q.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2003-02
- Volume
- 51
- Issue
- 2
- Pages
- 313-324
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2113168978
- Cited by
- 1,504
- References
- 11
- FWCI
- 66.28
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.