Abstract
We present low-complexity, quickly converging robust adaptive beamformers, for beamforming large arrays in snapshot deficient scenarios. The proposed algorithms are derived by combining data-dependent Krylov-subspace-based dimensionality reduction, using the Powers-of-R or conjugate gradient (CG) techniques, with ellipsoidal uncertainty set based robust Capon beamformer methods. Further, we provide a detailed computational complexity analysis and consider the efficient implementation of automatic, online dimension-selection rules. We illustrate the benefits of the proposed approaches using simulated data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
