On the Closed-Form Solution for Robust Adaptive Beamforming

TL;DR

This paper introduces a novel closed-form solution for robust adaptive beamforming that is more efficient, simpler, and applicable to rank-deficient scenarios, outperforming existing methods in computational speed.

Contribution

A new closed-form solution scheme for RAB is developed, providing efficiency, simplicity, and applicability to rank-deficient cases, along with conditions for solution existence and uniqueness.

Findings

Improved computational efficiency over MOSEK and RMVB.

Solution covers rank-deficient covariance scenarios.

Unveiled conditions for existence and uniqueness of solutions.

Abstract

In this paper, we consider the classical robust adaptive beamforming (RAB) problem. Conventionally, this problem is solved either with an off-the-shelf solver like MOSEK or through the well-known RMVB algorithm based on Lagrange multiplier approaches. The solver MOSEK is implemented with the general interior point method and RMVB is only limited to the full-rank covariance scenario. In order to improve the existing benchmarks, we develop a novel closed-form solution scheme containing three consecutive stages: Diagonalization Transform, Phase Alignment, and KKT Solution. The proposed scheme is specifically intended for the RAB problem and thus more efficient than MOSEK. Moreover, the derivation process is simpler than RMVB and the output solution can cover the rank-deficient covariance scenario in extra. Aside from a new solution, we manage to unveil the existence and uniqueness conditions, which have never been studied before. The simulation results show that the proposed solution improves the existing benchmarks in terms of computational time while maintaining optimality.