# Robust Adaptive Beamforming Using a Low-Complexity Steering Vector Estimation and Covariance Matrix Reconstruction Algorithm

Authors: Pei Chen; Yongjun Zhao; Chengcheng Liu
Journal: International Journal of Antennas and Propagation
 (2016)

---

## Abstract

A novel low-complexity robust adaptive beamforming (RAB) technique is proposed in order to overcome the major drawbacks from which the recent reported RAB algorithms suffer, mainly the high computational cost and the requirement for optimization programs. The proposed algorithm estimates the array steering vector (ASV) using a closed-form formula obtained by a subspace-based method and reconstructs the interference-plus-noise (IPN) covariance matrix by utilizing a sampling progress and employing the covariance matrix taper (CMT) technique. Moreover, the proposed beamformer only requires knowledge of the antenna array geometry and prior information of the probable angular sector in which the actual ASV lies. Simulation results demonstrate the effectiveness and robustness of the proposed algorithm and prove that this algorithm can achieve superior performance over the existing RAB methods.


---

## Body

## 1. Introduction

Aiming at receiving a signal from a certain direction and suppressing interferences and noise, adaptive beamforming has found widespread application in many fields ranging from radar, sonar, wireless communication, and radio astronomy to medical imaging, speech processing, and so forth [1–4]. Beamformers can be regarded as spatial filters, which have proper performance under ideal circumstances. The standard Capon beamformer (SCB) is an optimal spatial filter that maximizes the array output signal-to-interference-plus-noise ratio (SINR) [5]. However, it is sensitive to array steering vector (ASV) uncertainty and direction of arrival (DOA) estimation error for the desired signal (DS). The performance also degrades due to the presence of the DS component in the training data and small sample size. In order to improve the robustness of SCB, various robust adaptive beamforming (RAB) techniques have been proposed in the past decades [6].The existing RAB techniques mainly consist of diagonal loading (DL) technique [7], eigenspace-based (ESB) technique [8], uncertainty set-based technique [9, 10], and the reconstruction-based technique [11]. They have effective performance in the presence of different mismatches in typical situations. However, there exist some drawbacks that limit their application range, which include the difficulty to choose the optimal DL factor, the high probability of subspace swap for ESB beamformers at low signal-to-noise ratio (SNR), the cost of reducing output SINR due to the expansion of the uncertainty set when the SV mismatch is large, the ad hoc nature, and the high computational cost.Recently, a new approach to the design of RAB based on the interference-plus-noise (IPN) covariance matrix reconstruction has been introduced in [11]. This method utilizes the Capon spectrum to integrate over an angular sector separated from the direction of DS. The reconstruction-based beamformer is effective at removing the DS from the sample covariance matrix but suffers from its high computational complexity. The main computational cost is due to the large number of samples involved in both spectrum estimation and summation. On the other hand, the recent beamformers in [12, 13] enhance the robustness against ASV errors. However, the utilization of complicated optimization software restricts their applications in practical situations. To improve the reconstruction-based RAB technique, a Low-Complexity Shrinkage-Based Mismatch Estimation (LOSCME) algorithm is presented in [14]. But it can perform effectively only when the interfering sources are weak.To reduce the computational complexity of the RAB method in [11] and eliminate its dependence on the optimization software, in this paper, a novel reconstruction-based RAB algorithm is proposed. This algorithm is characterized by lower complexity and a closed-form formula estimation of the actual ASV. Moreover, it requires very little prior information and has a superior performance to previously reported RAB algorithms. The only prior information required is the knowledge of the antenna array geometry and the coarse angular sector in which the actual ASV lies. Three steps are needed to achieve this algorithm. Firstly, a subspace-based method is introduced to obtain a closed-form formula for ASV estimation, avoiding using the optimization software. Then, the IPN covariance matrix is reconstructed based on a spatial power spectrum sampling (SPSS) method [15], which is realized by a proposed sample equation. Finally, the covariance matrix taper (CMT) technique [16] is utilized to adopt the relatively small size of array systems in practice. Simulation results will be provided to prove the effectiveness and robustness of the proposed beamformer.The rest of this paper is organized as follows. The data model of array output and some necessary backgrounds about adaptive beamformer are described in Section2. In Section 3, a novel RAB algorithm is proposed by employing ASV estimation and IPN covariance matrix reconstruction. Simulation results are presented in Section 4. Finally, conclusion is drawn in Section 5.


## 2. Signal Model

Consider a uniform linear array (ULA) ofM omnidirectional antenna elements impinged by P narrowband uncorrelated far-field signals. The M
×
1 vector representing the received signal at the kth snapshot can be modeled as (1)
x
k
=
s
k
+
i
k
+
n
k
,where s
k, i
k, and n
k denote the statistically independent M
×
1 vectors of the DS, interference, and noise, respectively. The beamformer output is given by y
k
=
w
H
x
k, where w
=
w
1
,
w
2
,
…
,
w
M
T is the complex beamformer weighting vector, and ·
H and ·
T denote the Hermitian transpose and transpose, respectively. The beamformer output SINR is defined as(2)
S
I
N
R
=
σ
s
2
w
H
a
θ
s
2
w
H
R
i
+
n
w
,where θ
s is the assumed DOA of the DS and a
θ
s is the ASV, which has the general form a
θ
s
=
1
e
j
π
sin
⁡
θ
s
⋯
e
j
π
M
-
1
sin
⁡
θ
s
T. Meanwhile, σ
s
2 is the power of the DS, and R
i
+
n
=
E
i
k
+
n
k
i
k
+
n
k
H is the IPN covariance matrix.By maximizing the output SINR of the beamformer, the optimal weight vector can be obtained by(3)
m
i
n
w
w
H
R
i
+
n
w
subject  to
w
H
a
θ
s
=
1
.The solution is known as the Capon beamformer [13]:(4)
w
=
R
i
+
n
-
1
a
θ
s
a
H
θ
s
R
i
+
n
-
1
a
θ
s
.In practice, theoretical covariance matrixR
i
+
n is usually unavailable and sample covariance matrix (5) is used as an approximation:(5)
R
^
x
=
1
K
∑
k
=
1
K
x
k
x
k
,where K is the number of data snapshots.


## 3. Proposed Approach

The performance of standard beamformers degrades dramatically when the ASV errors exist and the DS with a high SNR is present in the training snapshots. To remove the DS from the sample covariance matrix, recently, an IPN covariance matrix reconstruction method was proposed [11].In [11], the IPN covariance matrix can be reconstructed by using the spatial spectrum of the array as(6)
R
i
+
n
=
∫
θ
∈
Θ
-
σ
2
θ
a
θ
a
H
θ
d
θ
,where σ
2
θ is the Capon spectrum σ
2
θ
=
1
/
a
H
θ
R
^
x
-
1
a
θ, Θ
- is the complement sector of Θ and Θ stands for the assumed direction range of the DS; that is, Θ
-
∩
Θ
=
⌀, and Θ
-
∪
Θ covers whole spatial domain.This method has mainly two aspects of drawbacks. Firstly, concerning the mismatch between the actual ASV and the nominal ASV, the IPN matrix may not be reconstructed accurately. Secondly, its high computational complexity restricts its practical performance [12]. In the following part, more precise estimation of the actual ASV can be achieved and the computational cost of IPN matrix reconstruction can be reduced.


### 3.1. Desired Signal Array Steering Vector Estimation

Similar to the reconstruction of IPN covariance matrix as (6), a new matrix C
a
s
v can be constructed by(7)
C
a
s
v
=
∫
Θ
c
θ
a
θ
a
H
θ
d
θ
,where c
θ denotes a probability density function, but the choice of c
θ is more flexible, which means that c
θ can be chosen to be independent of θ, for example, c
θ
=
1
,
∀
θ
∈
Θ, or adjust values depending on the prior information. Then, C
a
s
v can be eigendecomposed as(8)
C
a
s
v
=
∑
i
=
1
M
σ
i
v
i
v
i
H
=
V
Σ
V
H
,where σ
i
,
i
=
1
,
…
,
M are the eigenvalues of C
a
s
v in descending order, Σ
=
diag
⁡
σ
1
,
…
,
σ
M are diagonal matrices, v
i
,
i
=
1
,
…
,
M are the eigenvectors associated with σ
i, and V
=
v
1
,
…
,
v
M. Following the approach in [17], let S be the smallest integer such that ∑
i
=
1
S
σ
i
2
/
∑
i
=
1
M
σ
i
2
>
ξ, where 0
<
ξ
<
1 is a predetermined threshold. Then, the eigenvectors associated with S largest eigenvalues of C
a
s
v can be chosen to form the column orthogonal matrix V
S
=
v
1
,
…
,
v
S. As derivation in [18], the actual ASV a
θ
s lies in the subspace spanned by the columns of V
S.Similar to (8), in order to obtain the eigenvector, the sample covariance matrix R
^
x can be decomposed as(9)
R
^
x
=
∑
j
=
1
M
λ
j
e
j
e
j
H
=
E
s
Λ
s
E
s
H
+
E
n
Λ
n
E
n
H
,where λ
j
,
j
=
1
,
…
,
M are the eigenvalues of R
^
x in descending order, Λ
s
=
diag
⁡
λ
1
,
…
,
λ
P and Λ
n
=
diag
⁡
λ
P
+
1
,
…
,
λ
M are diagonal matrices, e
j
,
j
=
1
,
…
,
M are the eigenvectors associated with λ
j, and E
s
=
e
1
,
e
2
,
…
,
e
P and E
n
=
e
P
+
1
,
…
,
e
M denote the signal-plus-interference (SPI) subspace and noise subspace, respectively. It is well known that the actual ASV of DS a
θ
s belongs to the subspace spanned by the columns of E
s [19].As mentioned above, two constraints can be imposed ona:(10)
C
1
=
a
:
a
=
V
S
α
V
,
C
2
=
a
:
a
=
E
s
α
E
,where α
V and α
E are the coefficient vectors. Then, the actual ASV should be a vector lying within the intersection of C
0
=
C
1
∩
C
2. This intersection can be obtained by employing the theorem of sequential vector space projections [19], and the ASV of DS is proved to be estimated by(11)
a
e
s
=
M
P
P
C
1
P
C
2
,where P
C
1
=
V
S
V
S
H, P
C
2
=
E
s
E
s
H, and P
· denotes the eigenvector associated with the maximal eigenvalue of a matrix. This estimation method can be more efficient when the look direction error is large, and the method avoids the need of optimization software by using a closed-form formula.


### 3.2. Spatial Power Spectrum Sampling Based IPN Covariance Matrix Reconstruction

The main computational cost of the method in [11] is the integration approximation by summation, where S (the number of sampled values) times spectrum estimation and vector multiplication operations have to be performed. To reduce the cost, the complex spectrum estimation process should be eliminated.Consider the inner product of two steering vector which is written as(12)
f
θ
;
θ
0
=
1
M
a
H
θ
0
a
θ
,where θ
0 is a specified reference direction and θ
,
θ
0
∈
-
π
/
2
,
π
/
2. Substituting a
θ into (12) gives(13)
f
θ
;
θ
0
=
1
M
∑
k
=
0
M
-
1
e
j
k
π
sin
⁡
θ
-
sin
⁡
θ
0
.Let x
=
M
/
2
sin
⁡
θ
-
sin
⁡
θ
0
∈
-
1
-
sin
⁡
θ
0
M
/
2
,
1
-
sin
⁡
θ
0
M
/
2; (13) can be written as(14)
f
x
=
1
M
∑
k
=
0
M
-
1
e
j
2
π
/
M
k
x
=
1
M
·
sin
⁡
π
x
sin
⁡
π
/
M
x
e
j
M
-
1
/
M
π
x
.From the derivation above,f
x can be regarded as an inverse discrete Fourier transform (IDFT) of an M-point rectangular function in the frequency domain. When M is large enough, f
x can be approximated as a sinc function; that is, f
x
=
sinc
⁡
π
x
=
sin
⁡
π
x
/
π
x; f
θ
;
θ
0 will approximate a Kronecker delta function; that is,(15)
f
θ
;
θ
0
≈
δ
θ
,
θ
0
=
1
,
θ
=
θ
0
0
,
else.The function f
θ
;
θ
0 is called the selecting property of the steering vector in [15].Denote the zeros off
θ
;
θ
0 by θ
k, and consider (14); f
x
=
0 is obtained when x
∈
Z
=
z
∣
z
∈
-
1
-
sin
⁡
θ
0
M
/
2
,
1
-
sin
⁡
θ
0
M
/
2
,
z
∈
Z
,
z
≠
0; then there are M
-
1 such values in the set Z denoted by x
k
,
k
=
1,2
,
…
,
M
-
1. Then θ
k can be easily obtained by θ
k
=
arcsin
⁡
2
x
k
/
M
+
s
i
n
θ
0.Define a matrix usingθ
k
k
=
0
M
-
1:(16)
D
=
1
M
∑
θ
k
∈
Ω
a
θ
k
a
H
θ
k
,where Ω is a specified angular sector. Consider that R can be formed by integrating the spatial spectrum σ
2
θ though the whole region as(17)
R
=
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
a
θ
a
H
θ
d
θ
.Then, let Ω
=
Θ
-; (18) can be obtained as(18)
D
·
R
·
D
=
1
M
∑
θ
k
∈
Θ
-
a
θ
k
a
H
θ
k
·
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
a
θ
a
H
θ
d
θ
·
1
M
∑
θ
i
∈
Θ
-
a
θ
i
a
H
θ
i
=
∑
θ
k
∈
Θ
-
∑
θ
i
∈
Θ
-
a
θ
i
·
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
1
M
a
H
θ
i
a
θ
·
1
M
a
H
θ
a
θ
k
d
θ
·
a
H
θ
k
=
∑
θ
k
∈
Θ
-
∑
θ
i
∈
Θ
-
a
θ
i
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
f
θ
;
θ
i
f
θ
k
;
θ
d
θ
a
H
θ
k
.As discussed above, when M is large enough, D
·
R
·
D is a Hermitian matrix and can be approximated as(19)
D
·
R
·
D
≈
∑
θ
k
∈
Θ
-
∑
θ
i
∈
Θ
-
a
θ
i
∫
θ
∈
-
π
/
2
,
π
/
2
δ
θ
,
θ
i
δ
θ
k
,
θ
d
θ
a
H
θ
k
=
∑
θ
k
∈
Θ
-
σ
2
θ
k
a
θ
k
a
H
θ
k
.In this way, the IPN covariance matrix is estimated by the sample matrixD without calculating the spatial power spectrum. In practice, R can be replaced by R
^
x, which yields R
^
i
+
n
≈
D
·
R
^
x
·
D.However, whenM
≪
∞, there will be a large estimation error, because the sampling spacing is not dense enough. For the purpose of improving the performance, the covariance matrix tapering technique introduced in [16] is employed. The tapered matrix is given by R
T
=
R
∘
T, where “∘” denotes the Hadamard product and T is the taper matrix. Here, the Mailloux-Zatman (MZ) taper is used, which is defined as(20)
T
M
Z
=
a
m
n
M
×
M
=
sinc
⁡
m
-
n
Δ
π
,
Δ
>
0
,where Δ corresponds to the width of the dithering area. Hence, T
M
Z should be adopted to taper the sample covariance matrix R
^
x and estimated IPN covariance matrix, respectively; that is, the reconstruction of IPN covariance matrix can be obtain by(21)
R
~
i
+
n
=
D
·
R
^
x
∘
T
M
Z
·
D
∘
T
M
Z
.


### 3.3. The Proposed Beamforming Algorithm

Based on the discussions above, the proposed beamforming algorithm can be summarized by the following steps:Step 1.
Construct the two subspacesV
S and E
s by eigendecomposing C
a
s
v and R
^
x, respectively. Then estimate the ASV of DS a
e
s using (11).Step 2.
Specify the MZ taperT
M
Z using (20), and construct D by (16). Hence, the reconstruction of IPN covariance matrix can be obtained by using (21).Step 3.
Substituting the reconstructed IPN covariance matrixR
~
i
+
n and estimated ASV of DS a
e
s into the Capon beamformer, the weight vector of the proposed approach is computed as(22)
w
=
R
~
i
+
n
-
1
a
e
s
θ
s
a
e
s
H
θ
s
R
~
i
+
n
-
1
a
e
s
θ
s
.In the proposed algorithm, the main computational complexity lies in the eigendecomposition operation and the matrix inversion operation, both of which have complexity ofO
M
3. That means the overall computational complexity is O
M
3. Considering that the number of sampling points required in (7) and (16) is reasonably much less than that required in the beamformer in [11], the proposed beamformer has a lower cost than that of [11]. Additionally, compared to the existing RAB methods in [12, 13], which have complexity equal or higher than O
M
3.5, the proposed algorithm also avoids the need of optimization software and, thus, is easier to apply in practice.


## 3.1. Desired Signal Array Steering Vector Estimation

Similar to the reconstruction of IPN covariance matrix as (6), a new matrix C
a
s
v can be constructed by(7)
C
a
s
v
=
∫
Θ
c
θ
a
θ
a
H
θ
d
θ
,where c
θ denotes a probability density function, but the choice of c
θ is more flexible, which means that c
θ can be chosen to be independent of θ, for example, c
θ
=
1
,
∀
θ
∈
Θ, or adjust values depending on the prior information. Then, C
a
s
v can be eigendecomposed as(8)
C
a
s
v
=
∑
i
=
1
M
σ
i
v
i
v
i
H
=
V
Σ
V
H
,where σ
i
,
i
=
1
,
…
,
M are the eigenvalues of C
a
s
v in descending order, Σ
=
diag
⁡
σ
1
,
…
,
σ
M are diagonal matrices, v
i
,
i
=
1
,
…
,
M are the eigenvectors associated with σ
i, and V
=
v
1
,
…
,
v
M. Following the approach in [17], let S be the smallest integer such that ∑
i
=
1
S
σ
i
2
/
∑
i
=
1
M
σ
i
2
>
ξ, where 0
<
ξ
<
1 is a predetermined threshold. Then, the eigenvectors associated with S largest eigenvalues of C
a
s
v can be chosen to form the column orthogonal matrix V
S
=
v
1
,
…
,
v
S. As derivation in [18], the actual ASV a
θ
s lies in the subspace spanned by the columns of V
S.Similar to (8), in order to obtain the eigenvector, the sample covariance matrix R
^
x can be decomposed as(9)
R
^
x
=
∑
j
=
1
M
λ
j
e
j
e
j
H
=
E
s
Λ
s
E
s
H
+
E
n
Λ
n
E
n
H
,where λ
j
,
j
=
1
,
…
,
M are the eigenvalues of R
^
x in descending order, Λ
s
=
diag
⁡
λ
1
,
…
,
λ
P and Λ
n
=
diag
⁡
λ
P
+
1
,
…
,
λ
M are diagonal matrices, e
j
,
j
=
1
,
…
,
M are the eigenvectors associated with λ
j, and E
s
=
e
1
,
e
2
,
…
,
e
P and E
n
=
e
P
+
1
,
…
,
e
M denote the signal-plus-interference (SPI) subspace and noise subspace, respectively. It is well known that the actual ASV of DS a
θ
s belongs to the subspace spanned by the columns of E
s [19].As mentioned above, two constraints can be imposed ona:(10)
C
1
=
a
:
a
=
V
S
α
V
,
C
2
=
a
:
a
=
E
s
α
E
,where α
V and α
E are the coefficient vectors. Then, the actual ASV should be a vector lying within the intersection of C
0
=
C
1
∩
C
2. This intersection can be obtained by employing the theorem of sequential vector space projections [19], and the ASV of DS is proved to be estimated by(11)
a
e
s
=
M
P
P
C
1
P
C
2
,where P
C
1
=
V
S
V
S
H, P
C
2
=
E
s
E
s
H, and P
· denotes the eigenvector associated with the maximal eigenvalue of a matrix. This estimation method can be more efficient when the look direction error is large, and the method avoids the need of optimization software by using a closed-form formula.


## 3.2. Spatial Power Spectrum Sampling Based IPN Covariance Matrix Reconstruction

The main computational cost of the method in [11] is the integration approximation by summation, where S (the number of sampled values) times spectrum estimation and vector multiplication operations have to be performed. To reduce the cost, the complex spectrum estimation process should be eliminated.Consider the inner product of two steering vector which is written as(12)
f
θ
;
θ
0
=
1
M
a
H
θ
0
a
θ
,where θ
0 is a specified reference direction and θ
,
θ
0
∈
-
π
/
2
,
π
/
2. Substituting a
θ into (12) gives(13)
f
θ
;
θ
0
=
1
M
∑
k
=
0
M
-
1
e
j
k
π
sin
⁡
θ
-
sin
⁡
θ
0
.Let x
=
M
/
2
sin
⁡
θ
-
sin
⁡
θ
0
∈
-
1
-
sin
⁡
θ
0
M
/
2
,
1
-
sin
⁡
θ
0
M
/
2; (13) can be written as(14)
f
x
=
1
M
∑
k
=
0
M
-
1
e
j
2
π
/
M
k
x
=
1
M
·
sin
⁡
π
x
sin
⁡
π
/
M
x
e
j
M
-
1
/
M
π
x
.From the derivation above,f
x can be regarded as an inverse discrete Fourier transform (IDFT) of an M-point rectangular function in the frequency domain. When M is large enough, f
x can be approximated as a sinc function; that is, f
x
=
sinc
⁡
π
x
=
sin
⁡
π
x
/
π
x; f
θ
;
θ
0 will approximate a Kronecker delta function; that is,(15)
f
θ
;
θ
0
≈
δ
θ
,
θ
0
=
1
,
θ
=
θ
0
0
,
else.The function f
θ
;
θ
0 is called the selecting property of the steering vector in [15].Denote the zeros off
θ
;
θ
0 by θ
k, and consider (14); f
x
=
0 is obtained when x
∈
Z
=
z
∣
z
∈
-
1
-
sin
⁡
θ
0
M
/
2
,
1
-
sin
⁡
θ
0
M
/
2
,
z
∈
Z
,
z
≠
0; then there are M
-
1 such values in the set Z denoted by x
k
,
k
=
1,2
,
…
,
M
-
1. Then θ
k can be easily obtained by θ
k
=
arcsin
⁡
2
x
k
/
M
+
s
i
n
θ
0.Define a matrix usingθ
k
k
=
0
M
-
1:(16)
D
=
1
M
∑
θ
k
∈
Ω
a
θ
k
a
H
θ
k
,where Ω is a specified angular sector. Consider that R can be formed by integrating the spatial spectrum σ
2
θ though the whole region as(17)
R
=
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
a
θ
a
H
θ
d
θ
.Then, let Ω
=
Θ
-; (18) can be obtained as(18)
D
·
R
·
D
=
1
M
∑
θ
k
∈
Θ
-
a
θ
k
a
H
θ
k
·
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
a
θ
a
H
θ
d
θ
·
1
M
∑
θ
i
∈
Θ
-
a
θ
i
a
H
θ
i
=
∑
θ
k
∈
Θ
-
∑
θ
i
∈
Θ
-
a
θ
i
·
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
1
M
a
H
θ
i
a
θ
·
1
M
a
H
θ
a
θ
k
d
θ
·
a
H
θ
k
=
∑
θ
k
∈
Θ
-
∑
θ
i
∈
Θ
-
a
θ
i
∫
θ
∈
-
π
/
2
,
π
/
2
σ
2
θ
f
θ
;
θ
i
f
θ
k
;
θ
d
θ
a
H
θ
k
.As discussed above, when M is large enough, D
·
R
·
D is a Hermitian matrix and can be approximated as(19)
D
·
R
·
D
≈
∑
θ
k
∈
Θ
-
∑
θ
i
∈
Θ
-
a
θ
i
∫
θ
∈
-
π
/
2
,
π
/
2
δ
θ
,
θ
i
δ
θ
k
,
θ
d
θ
a
H
θ
k
=
∑
θ
k
∈
Θ
-
σ
2
θ
k
a
θ
k
a
H
θ
k
.In this way, the IPN covariance matrix is estimated by the sample matrixD without calculating the spatial power spectrum. In practice, R can be replaced by R
^
x, which yields R
^
i
+
n
≈
D
·
R
^
x
·
D.However, whenM
≪
∞, there will be a large estimation error, because the sampling spacing is not dense enough. For the purpose of improving the performance, the covariance matrix tapering technique introduced in [16] is employed. The tapered matrix is given by R
T
=
R
∘
T, where “∘” denotes the Hadamard product and T is the taper matrix. Here, the Mailloux-Zatman (MZ) taper is used, which is defined as(20)
T
M
Z
=
a
m
n
M
×
M
=
sinc
⁡
m
-
n
Δ
π
,
Δ
>
0
,where Δ corresponds to the width of the dithering area. Hence, T
M
Z should be adopted to taper the sample covariance matrix R
^
x and estimated IPN covariance matrix, respectively; that is, the reconstruction of IPN covariance matrix can be obtain by(21)
R
~
i
+
n
=
D
·
R
^
x
∘
T
M
Z
·
D
∘
T
M
Z
.


## 3.3. The Proposed Beamforming Algorithm

Based on the discussions above, the proposed beamforming algorithm can be summarized by the following steps:Step 1.
Construct the two subspacesV
S and E
s by eigendecomposing C
a
s
v and R
^
x, respectively. Then estimate the ASV of DS a
e
s using (11).Step 2.
Specify the MZ taperT
M
Z using (20), and construct D by (16). Hence, the reconstruction of IPN covariance matrix can be obtained by using (21).Step 3.
Substituting the reconstructed IPN covariance matrixR
~
i
+
n and estimated ASV of DS a
e
s into the Capon beamformer, the weight vector of the proposed approach is computed as(22)
w
=
R
~
i
+
n
-
1
a
e
s
θ
s
a
e
s
H
θ
s
R
~
i
+
n
-
1
a
e
s
θ
s
.In the proposed algorithm, the main computational complexity lies in the eigendecomposition operation and the matrix inversion operation, both of which have complexity ofO
M
3. That means the overall computational complexity is O
M
3. Considering that the number of sampling points required in (7) and (16) is reasonably much less than that required in the beamformer in [11], the proposed beamformer has a lower cost than that of [11]. Additionally, compared to the existing RAB methods in [12, 13], which have complexity equal or higher than O
M
3.5, the proposed algorithm also avoids the need of optimization software and, thus, is easier to apply in practice.


## 4. Simulations

In the simulations, without loss of generality, a ULA withM
=
30 omnidirectional sensors is considered. It is assumed that there is one DS from the presumed direction θ
s
=
5
°. Two uncorrelated interferences with random waveforms arrive from DOA angles of -
53
° and 32
°, respectively. The noise is modeled as zero-mean and unity variance spatially and temporally white Gaussian noise. The interference-to-noise ratio (INR) at each sensor is set to be fixed at 30 dB. For each scenario, 500 Monte Carlo trials are performed.The proposed beamformer is compared to the diagonal loading sample matrix inversion (LSMI) beamformer [20], the ESB beamformer [8], the worst-case-based beamformer [9], the sequential quadratic programming (SQP) based beamformer [18], the reconstruction-based beamformer [11], and the beamformer in [13]. The diagonal loading factor of the LSMI beamformer is chosen as twice the noise power. The dimension of the signal-plus-interference subspace is assumed to be always estimated correctly for the eigenspace-based beamformer. The value ε
=
0.3
M is selected for the worst-case-based beamformer as it has been recommended in [9], while the value δ
=
0.1 and 20 dominant eigenvectors of the matrix C are used in the SQP based beamformer. For the proposed beamformer, the reconstruction-based beamformer, and the beamformer in [13], the angular sector of the DS is presumed to be Θ
=
θ
p
-
5
°
,
θ
p
+
5
°. In this paper, ξ
=
0.95, θ
0
=
0
°, and Δ
=
2
arcsin
⁡
2
/
M are chosen in (11), (12), and (20), respectively.Example 1 (mismatch due to signal direction error).
The look direction mismatch of the DS is assumed to be random and uniformly distributed in[
-
4
°
,
4
°
] for each simulation run, which means the mismatch changes from run to run but keeps fixed from snapshot to snapshot. The array normalized beam patterns for the beamformers in a single simulation run where S
N
R
=
0
d
B and K
=
60 are displayed in Figure 1. It can be seen that, in the presence of pointing error, the proposed beamformer and ESB beamformer are able to point the main lobe to the actual direction, while the LSMI beamformer and worst-case-based beamformer cannot. Furthermore, the proposed beamformer has lower side lobes and deeper nulls at the directions of interferences, which make the proposed beamformer suppress the noise and interferences effectively.
Considering the influence of random look direction error on array output SINR, the performance curves versus the input SNR and the number of snapshots are drawn in Figures2(a) and 2(b), respectively. The number of snapshots is fixed to be K
=
60 and the INR is kept at 30 dB in Figure 2(a), while a fixed SNR for the DS at 10 dB and a fixed INR at 30 dB are considered in Figure 2(b). From the results shown in Figure 2, it can be found that the output SINR of the proposed algorithm is closer to the optimal SINR in a large range of SNR from -
10 to 50dB and for all values of number of snapshots from 10 to 100, which illustrates its high dynamic range. That means the proposed algorithm outperforms the other tested beamformers in the scenario where only signal direction error exists.
The SINR performance versus the pointing error is also investigated, and the results are shown in Figure3 with fixed SNR and INR at 10 dB and 30 dB, respectively. It can be see that the proposed beamformer effectively deals with a wide range of pointing errors and achieves the best performance among the tested beamformers even when the pointing error is as large as ±4°.Figure 1
Comparison of the normalized beam patterns in Example1 with S
N
R
=
0
d
B and K
=
60.Figure 2
Performance of the beamformers for the case of mismatch due to signal direction error. (a) Output SINR versus SNR for training data size ofK
=
60 and I
N
R
=
30
d
B. (b) Output SINR versus number of snapshots for fixed S
N
R
=
10
d
B and I
N
R
=
30
d
B.
(a)
(b)Figure 3
Output SINR versus pointing error for training data size ofK
=
60 and S
N
R
=
10
d
B and I
N
R
=
30
d
B.Example 2 (mismatch due to ASV random error).
In this simulation example, the ASV of DS is assumed to be randomly distributed in an uncertainty set, which can be modeled as(23)
a
θ
s
=
a
-
θ
s
+
e
,where a
-
θ
s represents the nominal SV corresponding to the direction θ
s and e is the random error vector, which is drawn in each simulation run independently from an uncertainty set as follows [12]:(24)
e
=
ε
M
e
j
ϕ
0
,
e
j
ϕ
1
,
…
,
e
j
ϕ
M
-
1
,where ε and ϕ
m are uniformly distributed in the intervals 0
,
3 and 0,2
π, respectively. Figures 4(a) and 4(b) correspond to the performance of the investigated methods versus the input SNR and the number of snapshots. It can be seen from the figures that the proposed beamformer and the reconstruction-based beamformer outperform the other tested beamformers. Table 1 shows the deviations from the optimal SINR for the beamformers at S
N
R
=
0
d
B and S
N
R
=
30
d
B, respectively. The performance improvement is a direct result of the ASV estimation and DS elimination, especially at high SNR values.
Furthermore, the proposed algorithm performs almost as well as the reconstruction-based beamformer for the output SINR but enjoys a faster convergence rate because of the lower computational cost without complex integral computation. Since the ASV mismatch is comprehensive and arbitrary-type, the proposed beamformer is proved to be effective against the random error of ASV.Table 1
Deviations from the optimal SINR for training data size ofK
=
60 and I
N
R
=
30 dB.
Beamformers
Deviations (dB)at SNR = 0 dB
Deviations (dB)at SNR = 30 dB
Proposed
1.330
1.347
LSMI
12.277
57.511
Worst-case-based
3.139
21.768
ESB
2.949
45.948
SQP
3.755
43.308
Reconstruction-based
1.081
1.083
Beamformer in [13]
3.122
39.040Figure 4
Performance of the beamformers for the case of ASV random error. (a) Output SINR versus SNR for training data size ofK
=
60 and I
N
R
=
30
d
B. (b) Output SINR versus number of snapshots for fixed S
N
R
=
10
d
B and I
N
R
=
30
d
B.
(a)
(b)Example 3 (mismatch due to incoherent local scattering).
In this example, it is assumed that the desired signal has a time-varying ASV which can be modeled as [11](25)
a
θ
s
;
k
=
u
0
k
a
-
θ
s
+
∑
p
=
1
4
u
p
′
k
a
′
θ
p
′
,where a
′
θ
p
′, without loss of generality, p
=
1,2
,
3,4, denotes the incoherently scattered signal paths. Assume that the directions θ
p
′ are randomly distributed in a Gaussian distribution with mean θ
s and standard deviation 2
°; u
0
k and u
p
′
k are independently and identically distributed complex Gaussian random variables drawn from N
0,1 which change from snapshot to snapshot.
In this scenario, the signal covariance matrixR
s is no longer a rank-one matrix; thus the output SINR should be rewritten in a more general form [9]:(26)
S
I
N
R
o
p
t
=
w
H
R
s
w
w
H
R
i
+
n
w
,which is maximized by [9](27)
w
o
p
t
=
P
R
i
+
n
-
1
R
s
,where P
· denotes the same operation as in (11). Figures 5(a) and 5(b) show the performance curves versus the input SNR and the number of snapshots. It can be seen from the figures that the proposed beamformer presents an effective performance when handling incoherent local scattering. Similar to Example 2, in detail, there is about 0.8 dB performance loss for the proposed algorithm comparing to the reconstruction-based beamformer. The main reason is that the DS may leak into the complement sector Θ
- due to the incoherent local scattering, which affects the accuracy of the ASV estimation.Figure 5
Performance of the beamformers for the case of incoherent local scattering. (a) Output SINR versus SNR for training data size ofK
=
60 and I
N
R
=
30
d
B. (b) Output SINR versus number of snapshots for fixed S
N
R
=
10
d
B and I
N
R
=
30
d
B.
(a)
(b)Example 4 (impacts of some factors on performance).
The main purpose of this example is to study the impacts of some factors on performance.ξ and Δ are two main factors in the proposed algorithm. The former affects the accuracy of the construction of subspace in which the actual ASV a
θ
s lies, and the latter decides the choice of taper matrix which plays a key role in the reconstruction of IPN covariance matrix.
For the purpose of studying the impacts of the two factors, the model of the mismatch is set to be the same as the first example. The number of snapshots is fixed to beK
=
50; the INR and SNR are kept at 20 dB and 10 dB, respectively. The performances of the proposed algorithm versus ξ and Δ are displayed in Figures 6(a) and 6(b), respectively. From Figure 6(a), it can be seen that the output SINR increases as ξ gets larger, but the growth range is quite small. Considering that the computational cost will not significantly increase as ξ gets larger, setting ξ
=
0.95 in the proposed algorithm is appropriate. Similarly, the result of the test of Δ is shown in Figure 6(b), in which the choice of Δ
=
2
arcsin
⁡
2
/
M can be found near the peak of the performance curve. To ensure a satisfying output performance, Δ can be decided by a test for a typical array before the algorithm operates. The procedure is offline and will not dramatically increase the system cost.Figure 6
Performance of the beamformers for the case of mismatch due to signal direction error. (a) Output SINR versusξ. (b) Output SINR versus Δ for training data size of K
=
50 and I
N
R
=
20
d
B and S
N
R
=
10
d
B.
(a)
(b)


## 5. Conclusion

In this paper, a novel low-complexity RAB method is proposed which is easier to realize in practical situations and more robust to the look direction mismatch than other existing algorithms. The ASV is estimated by a closed-form formula so as to avoid utilizing the optimization software, and the IPN covariance matrix is reconstructed by a sampling progress. The proposed beamformer only requires prior knowledge of the antenna geometry and the angular sector in which the ASV is located. Simulation results have demonstrated that the proposed beamformer can achieve superior performance over the existing state of the art RAB methods. To simplify the illustration, the influence of the element pattern, the polarization, and the mutual coupling is not considered in this paper. However, these elements will be investigated in the future study.



---

*Source: 2438183-2016-07-10.xml*