**1. Introduction**

Adaptive beamforming adjusts the weight vector according to the application environment to enhance the SOI by suppressing interference and noise, and it has been widely used in radar, sonar, microphone array speech processing, wireless communication, radio astronomy, and other areas [1–3]. Generally, the standard Capon beamformer (SCB) obtains the maximum-array-output-signal-to-interference-plus-noise ratio (SINR) if the covariance matrix and SOI SV are accurately known [4]. However, severe performance degradation may occur in the presence of SV and INCM mismatches due to the fact of array calibration errors, finite snapshots, and other factors, especially when the SOI component is presented in the INCM [5,6]. Therefore, various RAB algorithms have been proposed to ensure the robustness of beamformers over the past years. In general, these RAB methods can be classified into the following types [6,7]: diagonal loading (DL) technique, eigenspace-based (ESB) technique, uncertain-set based technique, and covariance matrix reconstruction-based technique.

DL is one of the most classical RAB methods for improving the robustness of a beamformer, which is derived by imposing a quadratic constraint either on the norm of the weight vector or on its SOI SV [8,9]. However, its major challenge is that it is difficult to choose the optimal DL level in different scenarios. To overcome this drawback, parameterfree methods in [4,10–13] can automatically compute the DL level without specifying

**Citation:** Duan, Y.; Yu, X.; Mei, L.; Cao, W. Low-Complexity Robust Adaptive Beamforming Based on INCM Reconstruction via Subspace Projection. *Sensors* **2021**, *21*, 7783. https://doi.org/10.3390/s21237783

Academic Editor: Jiangbing Du

Received: 5 October 2021 Accepted: 19 November 2021 Published: 23 November 2021

**Publisher's Note:** MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

**Copyright:** © 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/).

any additional user parameters. Regrettably, these methods fail to provide satisfactory performance in high-input signal noise rates (SNRs).

The ESB technique is another type of traditional RAB method that is performed by projecting nominal SV onto the signal-plus-interference subspace to eliminate the arbitrary SV mismatch of SOI [14–17]. However, serious performance degradation will appear at low-input SNRs. In [15], a modified ESB method based on covariance matrix enhancement was proposed to improve the performance at low SNRs. In addition, the authors in [17] proposed a method to obtain the basis vector of signal subspace among the eigenvectors of the SCM. However, these methods perform poorly in the presence of large SV mismatch and high-input SNRs.

The uncertain-set-based technique utilizes a spherical or ellipsoidal uncertainty constraint setting on the nominal SV to estimate the SOI SV including the worst-case-based (WCB) method [5,18], doubly constrained method [10,19], probabilistically constrained method [20,21], and linear programming method [22]. However, these methods do not eliminate the SOI component from the SCM, and severe performance degradation will occur in the presence of high-input SNRs [7]. In addition, most of them need to solve the second-order cone programming (SOCP) problem, which leads to high complexity. Actually, the uncertain-set-based technique has been demonstrated to be equivalent to the DL method [6].

The above methods are mainly aimed at estimating SOI SV or SCM. Although these methods can improve the robustness of a beamformer, all still suffer from serious performance degradation at high-input SNRs. In order to overcome this drawback, a new type of RAB method based on INCM reconstruction has been developed in recent years. The authors of [23] firstly employ the SCB to estimate interference SV and reconstruct the INCM, but the power of interference was not accurately estimated. Gu, in [24], proposed an RAB method based on INCM reconstruction and SV estimation, where the INCM is reconstructed by integrating over the complement of the SOI angular region. However, the complexity is increased significantly. Subsequently, in [25,26], low-complexity shrinkagebased mismatch estimation (LOCSME) and the sparsity of the source distribution were used to significantly reduce the complexity. Unfortunately, these methods can achieve good performance only in certain conditions. To resist more types of mismatches, a new estimator for INCM based on interference SV and power estimation is presented in [6], and a QCQP problem with new inequality constraint was established to estimate the SOI SV. In [27], the authors constructed and solved a set of linear equations to obtain the estimation of interference power. Furthermore, the residual noise power was considered to improve the estimation accuracy of incident signal power in [28]. In [29], the iterative mismatch approximation method was employed to estimate the power and SV of all incident signals; then, these estimates were used to reconstruct the INCM. In [30], all nominal SVs were adjusted to an accurate version by a line search along the corresponding gradient vector. Together with the recorded power, the INCM was reconstructed. The Capon spectrum can be approximated as the power of noise when the SV mismatch is large enough. To overcome this drawback, the authors in [31] used the principle of maximum entropy power spectrum to reconstruct the interference and SOI covariance matrix by estimating all powers of incident signals. Different from the above INCM reconstruction-based methods, the authors in [32] reconstructed the INCM by projecting the interference subspace onto the received snapshots, which can effectively eliminate the SOI component and achieve good performance. In [33], the INCM reconstruction relies on using the average value of noise eigenvalues instead of the eigenvalue of the SOI to eliminate a noticeable part of the SOI. Ai et al. [34] presented an RAB algorithm for subspace projection and covariance reconstruction (SPCMR) that employs subspace projection and oblique projection to estimate the SOI SV and interference powers accurately. In [35], each SV was derived from the vector located at the intersection of two subspaces. Meanwhile, the estimate of each SV was given in a closed-form expression.

In this paper, a low-complexity RAB method based on INCM reconstruction and SOI SV estimation is proposed. Unlike previous methods, the INCM in the proposed method was reconstructed utilizing the orthogonality of subspace. First, based on the idea of the matrix filter in [36,37], the minimum mean square error criterion was employed to construct the blocking matrix. Then, we performed eigen-decomposition on the SCM and obtained the orthogonal projection matrix of the signal subspace. By projecting the blocking matrix onto the orthogonal projection matrix, a projection matrix was obtained. Subsequently, the INCM was reconstructed by replacing the eigenvector columns of the SCM, which can span to the signal subspace with the corresponding eigenvectors of the projection matrix. Finally, the SOI SV was estimated by employing the iterative mismatch approximation method presented in [29]. The theoretical analysis and simulation results demonstrated that the proposed method can efficiently deal with multiple types of mismatches.

The rest of this paper is organized as follows. The signal model and necessary background regarding the adaptive beamforming method is introduced in Section 2. In Section 3, the proposed RAB methods are described in detail, and the feasibility analysis of the blocking matrix is performed. The simulation results are provided in Section 4. Finally, conclusions are drawn in Section 5.

#### **2. Signal Model and Background**

Consider a uniform linear array (ULA) composed of *M* omnidirectional sensors that are illuminated by *L* + 1 far-field uncorrelated narrowband signals, which consist of one SOI and *L* interferences. The array complex sample vector at time *k* can be presented as:

$$\mathbf{x}(k) = \mathbf{x}\_{\mathbb{S}}(k) + \mathbf{x}\_{i}(k) + \mathbf{x}\_{\mathbb{H}}(k),\tag{1}$$

where *<sup>x</sup>s*(*k*) = *<sup>s</sup>*0(*k*)*<sup>a</sup>*0 and *<sup>x</sup>i*(*k*) = ∑*<sup>L</sup> l*=1 *sl*(*k*)*<sup>a</sup>l*, respectively, represent the *M* × 1 vector of the SOI and interference signal component in the received data. *sl*(*k*) and *<sup>a</sup>l*(*l* = 0, . . . , *L*) are the *l*th incident signal waveform and corresponding SV. *<sup>x</sup>n*(*k*) is additive complex Gaussian noise with a zero mean and a variance of *σ*<sup>2</sup> *n*, which is uncorrelated with all the other signals. In this paper, the sensors were spaced at half of the wavelength. The nominal SV from *θ* can be written as:

$$\begin{aligned} \mathbf{a}(\theta) &= \begin{bmatrix} 1, \mathbf{e}^{-j\frac{2\pi d}{\lambda}\sin\theta}, \dots, \mathbf{e}^{-j(M-1)\frac{2\pi d}{\lambda}\sin\theta} \end{bmatrix}^T \\ &= \begin{bmatrix} 1, \mathbf{e}^{-j\pi\sin\theta}, \dots, \mathbf{e}^{-j(M-1)\pi\sin\theta} \end{bmatrix}^T \end{aligned} \tag{2}$$

where (·) *T* denotes the transpose, and *λ* and *d*, respectively, denote signal wavelength and distance between two adjacent sensors.

The output of the beamformer is written as:

$$y(k) = \mathfrak{w}^H \mathfrak{x}(k),\tag{3}$$

where *w* = (*<sup>w</sup>*1,..., *w M*) *T* is the complex beamformer weight vector, and (·) *H* is the Hermitian transpose. The optimal beamformer weight vector, *w*, can be calculated by maximizing the output SINR, which is defined as follow:

$$SINR \stackrel{\triangle}{=} \frac{\sigma\_0^2 \left| \boldsymbol{w}^H \boldsymbol{a}\_0 \right|^2}{\boldsymbol{w}^H \boldsymbol{\mathcal{R}}\_{i+n} \boldsymbol{w}} \,\tag{4}$$

where *σ*<sup>2</sup> 0 = *E* |*<sup>s</sup>*0(*k*)| 2 and *a*0 denote the SOI power and SV, *<sup>E</sup>*[·] denotes the expectation operator of the stochastic variable. *Ri*+*n* ∈ C *M*×*M* denotes the precise INCM which can be written as:

$$\begin{array}{lcl} \mathcal{R}\_{i+n} &= E\left\{ [\mathbf{x}\_i(k) + \mathbf{x}\_n(k)][\mathbf{x}\_i(k) + \mathbf{x}\_{\text{ll}}(k)]^H \right\} \\ &= \sum\_{l=1}^L \sigma\_l^2 \mathbf{a}\_l \mathbf{a}\_l^H + E\left[ \mathbf{x}\_{\text{ll}}(k) \mathbf{x}\_{\text{ll}}^H(k) \right] \\ &= \mathcal{R}\_i + \sigma\_n^2 \mathbf{I}\_i \end{array} \tag{5}$$

where *σ*<sup>2</sup> *l* = *E* |*sl*(*k*)| 2 and *I* denote the *l*th interference power and identity matrix, respectively, and *σ*<sup>2</sup> *n* is the noise power. The main purpose of the optimal beamformer is to maximize the output SINR while keeping the SOI undistorted at the same time, which is the so-called the minimum variance distortionless response (MVDR) problem [2]:

$$\min\_{\mathbf{w}} \mathbf{w}^H \mathbf{R}\_{i+n} \mathbf{w} \\ \text{s.t.} \mathbf{w}^H \mathbf{a}\_0 = 1. \tag{6}$$

The optimal beamformer weight vector is given by:

$$w\_{\text{opt}} = \frac{\mathcal{R}\_{i+n}^{-1} a\_0}{a\_0^H \mathcal{R}\_{i+n}^{-1} a\_0}. \tag{7}$$

In practical applications, the precise INCM *Ri*+*n* is always unavailable, and it is usually replaced by SCM *R*ˆ :

$$\hat{\mathcal{R}} = \frac{1}{K} \sum\_{k=1}^{K} \mathbf{x}(k)\mathbf{x}^{H}(k),\tag{8}$$

where *K* denotes the number of snapshots. As K increases, *R*ˆ converge to the actual one. It has been proved that replacing *Ri*+*n* by SCM *R*ˆ does not change the optimal output SINR [2]. Substituting the actual SOI SV *a*0 by the nominal SV *a*0 based on the known array structure, the optimal weight vector becomes the sample covariance inversion (SMI) beamformer:

$$
\mathfrak{w}\_{SMI} = \frac{\mathfrak{R}^{-1}\mathfrak{a}\_0}{\mathfrak{a}\_0^H \mathfrak{R}^{-1}\mathfrak{a}\_0}.\tag{9}
$$

With the optimal weight vector, the Capon spatial power spectrum, is employed as a power estimator over all directions [28]:

$$\begin{aligned} \label{eq:SDAR} \dot{\mathcal{P}}(\theta) &= \mathfrak{w}\_{SMI}^{H} \mathring{\mathfrak{R}} \mathfrak{w}\_{SMI} \\ &= \frac{1}{\mathfrak{a}^{H}(\theta) \mathfrak{R}^{-1} \mathfrak{a}(\theta)} \,' \end{aligned} \tag{10}$$

where *a*(*θ*) is the nominal SV associated with *θ* ∈ (−90◦, <sup>90</sup>◦).

## **3. Proposed Method**

The main idea of the proposed method is to utilize the reconstructed INCM and the corrected SOI SV to derive the optimal weight vector. Depending on the minimum mean square error criterion, a blocking matrix is obtained. The orthogonality of the subspace is employed to derive the projection matrix, and the INCM is reconstructed by replacing the eigenvector columns of the SCM such that they can span to the signal subspace with the corresponding eigenvectors of the projection matrix. The optimal weight vector is obtained along with the SOI SV estimated by the iterative mismatch approximation method.

#### *3.1. INCM Reconstruction*

Different from Capon power spectrum integration and interference estimation based INCM reconstruction methods, we present a blocking matrix based on the matrix filter principle in [36,37], which is suitable for suppressing signals illuminating within a specific angular region. Consider a blocking matrix *G* ∈ C*M*×*M*, the property of *G* can be described as: 

$$\mathbf{G}^{H}\overline{\mathbf{a}}(\theta) = \begin{cases} \ \overline{\mathbf{a}}(\theta), & \theta \in \Theta\_{p} \\ \ 0, & \theta \in \Theta\_{s} \end{cases},\tag{11}$$

where **Θ***s* denotes the stopband angular region, and the direction of arrival (DOA) of the SOI lies in it. **<sup>Θ</sup>***p* denotes the passband angular region which contains the locations of interference. Sampling **Θ***s* and **<sup>Θ</sup>***p* uniformly with the *Ns* and *Np* sampling points, the corresponding angular sequences can be presented as *θp p* = 1, . . . , *Np* and *θs* (*s* = 1, . . . , *Ns*). The blocking matrix design problem based on the minimum mean square error criterion can be described as:

$$\min\_{\mathbf{G}} \|\|\mathbf{G}^H \mathbf{P} - \mathbf{P}\|\|\_{F'} \tag{12}$$

where ·*F* denotes Frobenius norm. *P* = *a***<sup>Θ</sup>***p*, *<sup>a</sup>*(**<sup>Θ</sup>***s*) ∈ C*M*×(*Np*+*Ns*) denotes the nominal manifold matrix, and *P*˘ = *a***<sup>Θ</sup>***p*, 0*M*×*Ns* ∈ C*M*×(*Np*+*Ns*) denotes the desired manifold matrix. The solution to (12) can be found by taking the gradient of *F*(*G*) = *GHP* − *P*˘ *F* and making it equal to zero:

$$\begin{array}{rcl} \frac{\partial F(\mathbf{G})}{\partial \mathbf{G}} &=& \frac{\partial}{\partial \mathbf{G}} tr \left[ \left( \mathbf{G}^{H} \mathbf{P} - \mathbf{P} \right)^{H} \left( \mathbf{G}^{H} \mathbf{P} - \mathbf{P} \right) \right]^{\frac{1}{2}} = \mathbf{0} \\\ \mathbf{G} &=& \left( \mathbf{P} \mathbf{P}^{H} \right)^{-1} \mathbf{P} \mathbf{P}^{H} .\end{array} \tag{13}$$

Performing eigen decomposition on *R*ˆ yields:

$$\begin{array}{lcl}\mathcal{R} &= \sum\_{i=1}^{M} \Gamma\_{i} \boldsymbol{u}\_{i} \boldsymbol{u}\_{i}^{H} = \mathsf{U} \boldsymbol{T} \boldsymbol{U}^{H} \\ &= \mathsf{U}\_{s} \Gamma\_{s} \boldsymbol{U}\_{s}^{H} + \mathsf{U}\_{\boldsymbol{n}} \Gamma\_{\boldsymbol{n}} \boldsymbol{U}\_{\boldsymbol{n}}^{H} \end{array} \tag{14}$$

where *Γ*1 ≥ *Γ*2 ≥ ··· *ΓM*−<sup>1</sup> ≥ *ΓM* denotes the eigenvalues of *R*ˆ arranged in descending order. The minimum eigenvalue can be approximately considered as the estimation of the noise power *σ*2*n* [6]. *ui* ∈ C*M*×<sup>1</sup> is an eigenvector associated with *Γi*. *Us* = (*<sup>u</sup>*1,..., *<sup>u</sup>L*+<sup>1</sup>) ∈ C*M*×(*<sup>L</sup>*+<sup>1</sup>) and *Un* = (*<sup>u</sup>L*+2,..., *<sup>u</sup>M*) ∈ <sup>C</sup>*M*×(*<sup>M</sup>*−*L*−<sup>1</sup>), respectively, denote the signal subspace eigenvectors and the noise subspace eigenvectors. *Γs* = *diag*(*<sup>Γ</sup>*1,..., *<sup>Γ</sup>L*+<sup>1</sup>) ∈ C*M*×(*<sup>L</sup>*+<sup>1</sup>) and *Γn* = *diag*(*<sup>Γ</sup>L*+2,..., *<sup>Γ</sup>M*) ∈ C*M*×(*<sup>M</sup>*−*L*−<sup>1</sup>) are diagonal matrices. According to the properties of the eigen subspace, we have:

$$\text{span}\{\mathfrak{u}\_1, \dots, \mathfrak{u}\_{L+1}\} = \text{span}\{\mathfrak{a}\_0, \dots, \mathfrak{a}\_L\},\tag{15}$$

where *span*{*<sup>u</sup>*1,..., *<sup>u</sup>L*+<sup>1</sup>} denotes the spanned subspace generated by the vector group {*<sup>u</sup>*1,..., *<sup>u</sup>L*+<sup>1</sup>}. Then, any accurate SV *al* can be expressed as a linear combination of columns of *Us* [27], which means that the projection matrix *Φ* = *<sup>U</sup>s<sup>U</sup>Hs G* is orthogonal to *a*0. *Q* = *<sup>Φ</sup>Ha*(*θ*)<sup>2</sup> is used to measure the orthogonality between projection matrix *Φ* and *<sup>a</sup>*(*θ*). Assume that the SOI and interference impinge on the half-wavelength spacing ULA with *M* = 10 from *θ*0 = 3◦, *θ*1 = <sup>−</sup>35◦, and *θ*2 = 42◦, the stopband and passband region are set as **Θ***s* = (*<sup>θ</sup>*0 − 6◦, *θ*0 + 6◦) and **<sup>Θ</sup>***p* = (−90◦, *θ*0 − 6◦) (*<sup>θ</sup>*0 + 6◦, <sup>90</sup>◦). It can be observed from Figure 1 that *Q* will be much smaller when *θ* = *θ*0 than *θ* = *θ*1,2. This means *Φ* and *<sup>a</sup>*(*<sup>θ</sup>*0) are orthogonal or approximately orthogonal. In addition, the value of *Q* corresponding to *θ*1,2 is equal to *<sup>a</sup>*(*<sup>θ</sup>*1,2)2. Hence, projection matrix *Φ* collects the spatial information of interference and removes the spatial information of the SOI.

Consider that the interference SV lies in the signal subspace spanned by the dominant eigenvectors of *Φ*. Then, employing eigen decomposition on *Φ* to obtain the signal subspace:

$$
\Phi = B\Lambda B^H = B\_s \Lambda\_s B\_s^H + B\_n \Lambda\_n B\_n^H \,\tag{16}
$$

where *B* = [*b*1,..., *bM*] = [*<sup>B</sup><sup>s</sup>*,*Bn*] and **Λ** = *diag*{*<sup>λ</sup>*1,..., *<sup>λ</sup>M*), respectively, denote unitary and diagonal matrices. *bl*, *l* = 1, ... , *M* denotes the eigenvector corresponding to *λl*, which are arranged in descending order. In addition, *Bs* contains *L* + 1 eigenvectors columns corresponding to the *L* + 1 largest eigenvalues, and *span*{*b*1,..., *bL*+<sup>1</sup>} can be considered as the signal subspace.

**Figure 1.** The value of *<sup>Φ</sup>Ha*(*θ*)<sup>2</sup> versus *θ*.

Substituting *Bs* back into (14) and replacing *U<sup>s</sup>*, then we can obtain the reconstructed INCM:

$$
\tilde{\mathcal{R}}\_{i+n} = \mathcal{B}\_s \Gamma\_s \mathcal{B}\_s^H + \mathcal{U}\_n \Gamma\_n \mathcal{U}\_n^H \, , \tag{17}
$$

plotting the power spectrum of *R i*+*n* by replacing *R i*+*n* with *R*ˆ in (10), which is written as:

$$\tilde{P}(\theta) = \frac{1}{\mathbb{Z}^H(\theta)\check{\mathbb{K}}\_{n+i}^{-1}\mathbb{Z}(\theta)}. \tag{18}$$

The spatial power spectrum distribution based on (10) and (18) is drawn in Figure 2. The SOI was assumed to be impinging from *θ*0 = 3◦ with a fixed *SNR* = 30 dB and that two interferences were impinging from *θ*1 = −35◦ and *θ*2 = 42◦ with a fixed interferenceto-noise rate (INR) *INR* = 20 dB, respectively. This shows that the blocking matrix can effectively filter the SOI components and interference components are retained. Therefore, *R i*+*n* can be used as an INCM to derive the beamformer.

**Figure 2.** Comparison of the Capon power spectrum (10) and the power spectrum based on (18) with *SNR* = 30 dB, *INR* = 20 dB, and *K* = 100.

#### *3.2. SOI SV Estimation and Beamformer Weight Vector Calculation*

For estimating the SOI SV, we employed the iterative mismatch approximation method proposed in [29] to correct the presumed SOI SV. The iterative mismatch approximation method depends on searching for the SV mismatch in the margin of the amplitude and phase error. In the presence of SV mismatches, the actual SOI SV can be written as *a*0 = *a*0 + *e* = *α* ◦ *a*0 ◦ *<sup>e</sup>jβ*. Employing the principle of estimating the signal steering vectors via maximizing the beamformer output power [16], the estimated SOI SV *a*0 can be obtained by solving the pseudo-optimization problem:

$$\begin{array}{ll}\max\_{\mathfrak{a},\mathfrak{g}} \tilde{P}(\theta\_{\mathfrak{q}}, \mathfrak{a}, \mathfrak{g})\\ \text{s.t.} \quad |1 - \mathfrak{a}\_{\mathfrak{m}}| & \le \mathfrak{e} \\ & |\beta\_{\mathfrak{m}}| & \le \Phi\_{\prime} \end{array} \tag{19}$$

where ◦ denotes the Hadamard product, and the power spectrum associated with *θq*, *α*, *β* is written as *P <sup>θ</sup>q*, *α*, *β* = 1/*α* ◦ *<sup>a</sup>*(*<sup>θ</sup>q* ◦ *ejβ*)*<sup>H</sup>R*<sup>ˆ</sup> <sup>−</sup><sup>1</sup>*α* ◦ *<sup>a</sup><sup>θ</sup>q* ◦ *<sup>e</sup>j<sup>β</sup>*. and *Φ* denote the predefined boundary values of the amplitude and phase mismatch, respectively. *α* = (*<sup>α</sup>*1,..., *<sup>α</sup>M*)*<sup>T</sup>* and *β* = (*β*1 ..., *βM*)*<sup>T</sup>* denote the amplitude and phase mismatch vectors, respectively. The iterative mismatch approximation method is described in Algorithm 1. In addition, the initial nominal SOI SV is associated with the middle value of **Θ***<sup>s</sup>*.

**Algorithm 1.** Iterative mismatch approximation method.

**Input:** , *Φ*, *<sup>a</sup>q*, *R* ˆ −1 **Output:** *<sup>a</sup>q*, *pwr* 1: Initialize *a* = *<sup>a</sup>q* 2: **for** *it*1 = 1... *M* 3: **~ Θ***α* = *αql*, *αqh* = [1 − , 1 + ]**, ~<sup>Θ</sup>***β* = *βql*, *βqh* = *<sup>e</sup>j*(−*<sup>Φ</sup>*), *ej*(*Φ*) 4: **for** *it*2 = 1... *depth* 5: *<sup>E</sup>ap* = **~ <sup>Θ</sup>***β* ⊗ **~ Θ***<sup>α</sup>*, *<sup>E</sup>ap* ∈ C1×<sup>4</sup> 6: *<sup>a</sup>i*(*it*1) = *<sup>a</sup>q*(*it*1)*<sup>E</sup>gp*(*i*), *i* = 1, . . . , 4 7: Calculate *p*(*i*) by substituting *ai* into Equation (10) 8: (*pwr*, *idx*) = *max*(*p*) 9: Zoom out of the amplitude/phase error area built by **~ Θ***α* and **~ <sup>Θ</sup>***β* to *Eap*(*idx*) 10: Update **~ Θ***α* and **~ <sup>Θ</sup>***β* 11: **end** 12: *<sup>a</sup>q*(*it*1) = *<sup>a</sup>q*(*it*1)*<sup>E</sup>ap*(*idx*) 13: **end**

Then, the estimated SOI SV *a*0 can be corrected as *<sup>a</sup>q*. Substituting (17) together with *a* 0 back into the Capon beamformer (7), the robust adaptive beamforming based on INCM reconstruction via the projecting matrix and SV estimation can be written as:

$$
\tilde{w} = \frac{\check{\mathbb{K}}\_{i+n}^{-1} \tilde{a}\_0}{\tilde{a}\_0^H \check{\mathbb{R}}\_{i+n}^{-1} \tilde{a}\_0}. \tag{20}
$$

In a general case, the estimated SOI SV may be imprecise. Hence, we took *a*0 as an input parameter and performed multiple iterations to improve accuracy. The iteration was terminated when the following conditions were satisfied:

$$\left| \frac{\left| \hat{\sigma}\_q^2 \right|\_{\text{current}} - \hat{\sigma}\_q^2 \Big|\_{\text{previous}}}{\hat{\sigma}\_q^2 \Big|\_{\text{previous}}} \right| < \left. \mathcal{p} \right. \tag{21}$$

where *ϕ* and *σ*2*q* denote a predefined saturation coefficient and power corresponding to *<sup>a</sup>q*, respectively. The method we propose is summarized in Algorithm 2.

**Algorithm 2.** Proposed RAB method.

	- **3:** Eigen decompose *Φ* to obtain *Bs* and reconstruct INCM via (17);
	- **4:** Using the iterative mismatch approximation method in Algorithm 1 to estimate the SOI SV;
	- **5**: Substitute *R i*+*n* and *a*0 back into (20) to obtain the weight vector.

**—**

The number of floating-point operations (flops) was employed to measure the computational complexity. The computational complexity of the proposed method is mainly determined by calculating the SCM *R*ˆ and matrix eigen decomposition, calculating *G* and estimating SOI SV *<sup>a</sup>*0. Calculating the SCM *R*ˆ costs approximately *OM*2*K* flops. Calculating *G* costs approximately *ONSM*<sup>2</sup> + *NPM*<sup>2</sup> + 2*M*<sup>3</sup> flops. The computational complexity of matrix inversion and eigen decomposition is approximately *OM*<sup>3</sup> flops. Assuming that *depth* = *D*, the computational complexity of estimating the SOI SV would be approximately *OM*<sup>3</sup> + 3*DM* flops. In practice, calculating *G* is independent of *R*ˆ and can be seen as a pre-processing operation of the proposed method. With *K M* ∼= *D*, the overall complexity of proposed method is approximately *OM*2*K* flops. In [6], the major computationswereconductedtosolveaQCQPproblemandestimateinterferenceSVs.

Suppose that *S* denotes the number of search points in **Θ**, the computational complexity is *<sup>O</sup>maxM*2*S*, *<sup>M</sup>*3.5. In [30], the sample points, *N*, for the line search significantly affected the adjustment of the SVs. Hence, when *N* > *M*, the computational complexity is *<sup>O</sup>LNM*<sup>2</sup>. The computational complexity of the MEPS-IPNC in [31] was *<sup>O</sup>M*2*L*, where *L* is a small multiple of *M*. In [32], the computational complexity was *<sup>O</sup>maxM*<sup>2</sup> *J*, *<sup>M</sup>*2*S*, where *S* and *J* are the number of the sampling points in **Θ***s* and **Θ***s* ∪ **Θ***i*. In [33], the computational complexity was declared to be *<sup>O</sup>M*<sup>3</sup>. In [34], the computational complexity was *<sup>O</sup>maxM*<sup>2</sup> *J*, *<sup>M</sup>*2*S*, where *S* and *J* are the number of the sampling points in **Θ** and **— Θ**. In [35], the computational complexity was declared to be *OM*<sup>2</sup> *I*(*L* + <sup>1</sup>), where I is the numberofsamplepointsfor **Θ** and **Θ***i*−*l*.Clearly,sincethepowerspectrumcalculation,

 power spectrum integration, and QCQP problem solving are avoided in our proposed method, it has the lowest computational complexity. Furthermore, prior information regarding the SOI angular region and array geometry are needed.
