Underdetermined Wideband DOA Estimation for Off-Grid Sources with Coprime Array Using Sparse Bayesian Learning

Abstract

Sparse Bayesian learning (SBL) is applied to the coprime array for underdetermined wideband direction of arrival (DOA) estimation. Using the augmented covariance matrix, the coprime array can achieve a higher number of degrees of freedom (DOFs) to resolve more sources than the number of physical sensors. The sparse-based DOA estimation can deteriorate the detection and estimation performance because the sources may be off the search grid no matter how fine the grid is. This dictionary mismatch problem can be well resolved by the SBL using fixed point updates. The SBL can automatically choose sparsity and approximately resolve the non-convex optimizaton problem. Numerical simulations are conducted to validate the effectiveness of the underdetermined wideband DOA estimation via SBL based on coprime array. It is clear that SBL can obtain good performance in detection and estimation compared to least absolute shrinkage and selection operator (LASSO), simultaneous orthogonal matching pursuit least squares (SOMP-LS) , simultaneous orthogonal matching pursuit total least squares (SOMP-TLS) and off-grid sparse Bayesian inference (OGSBI).

1. Introduction

Wideband direction of arrival (DOA) estimation using sensor arrays is an active research topic since it has broad applications requiring estimation the so-called angular spectrum, for example, in radar, sonar, wireless communication and localization, to name a few [1]. Because the DOA estimation accuracy is determined by the degrees of freedom (DOFs) of the sensor array, uniform spaced arrays need to increase the number of sensors to attain the high number of DOFs, and then raise the manufacturing cost as well as the difficulty of array calibration. Sparse arrays, i.e., nested array and coprime array [2,3], can obtain the higher number of DOFs to resolve more sources than the number of physical sensors using nonuniform sensor positions. Furthermore, for the sparse arrays the increased number of DOFs is achieved by exploiting the extended difference coarray, whose virtual sensor positions are determined by the consecutive and non-consecutive lag differences among the physical sensors.

Among sparse arrays, the coprime array has attracted considerable interest to the application of DOA estimation [4,5,6,7] because of the simplicity of the array configuration and the ability to detect more signals than the number of physical sensors. In [8], utilizing multiple frequencies to fill the missing coarray elements, the coprime array can effectively attain all of the offered DOFs for high resolution DOA estimation. Exploiting the sparse sparsity in the array signal model, the techniques of sparse signal representation [9,10,11] facilitate the progress of DOA estimation. These sparse signal representation based algorithms not only discretize the range of interest into a grid of spatial angles, but also assume that the true signal DOAs must fall on the predefined grid. However, in practical situations no matter how dense the grid is, the true DOAs may not necessarily lie on the exact sampling grid. This off-grid sources can cause the dictionary mismatch problem which not only violates the sparsity conditions but also deteriorates the performance [12]. In [13], the underdetermined wideband DOA estimation using group sparsity of two-step approach for off-grid sources is proposed to provide improved performance over the existing group sparsity based methods with the same search grid. In order to solve the problem that joint sparsity fails to capture the true structure of the signals, a novel wideband DOA estimation algorithm within the sparse Bayesian framework is proposed to allow a much more flexible occupation of the spectrum band, and automatically determine the underlying band occupation by imposing a Dirichlet process prior on the latent parametric space in [14].

Sparse Bayesian learning (SBL), as an alternative compressive sensing (CS) implementation, offers to relief the shortcoming that several sparse solutions might correspond to a single source when jointly processing multiple frequencies and multiple snapshots in order to localize one or more sources [15,16,17]. Being a probabilistic approach, SBL computes the posterior distribution of the sparse weight vectors and then provides estimations of their covariance along with the mean [18]. The idea of SBL applied to the single measurement vector (SMV) model for sparse signal recovery is to find the posterior probability $p\left(x\mid y;\mathsf{\Theta }\right)$ via the Bayesian rule, where $\mathsf{\Theta }$ indicates the set of all the hyperparameters [19,20,21]. The hyperparameters are estimated from data by marginalizing over x and then performing evidence maximization or Type-II Maximum likelihood [22]. The charm of SBL is that its global minima are always the sparest one [23], while the popular $l_1-norm$ based optimization algorithms [24] are not globally convergent. Therefore, the SBL based algorithms significantly outperform the traditional $l_1-norm$ based optimization algorithms.

In this paper, we focus on the underdetermined wideband DOA estimation for off-grid sources based on the coprime array using SBL algorithm. The coprime array, using minimal sparse rulers to reconstruct the spatial covariance matrix, enable nonuniform sampling approach which advocates the acquisition of a small number of samples to avoid aliasing for wideband signals. Vectorizing the covariance matrix and using kronecker product to the virtual manifold matrix from the coprime array, the DOA estimation for wideband signals can be obtained using the SBL algorithm. The SBL algorithm, developed within the sparse Bayesian framework, can approximately resolve the non-convex optimization problem and automatically determine sparsity using fixed point updates. The SBL scheme for wideband DOA estimation can provide processing advantages especially at low signal-to-noise ratio (SNR) under the acquisition of a small number of samples.

The remained of the paper is organized as follows. In Section 2 the signal model with coprime array is illustrated for wideband signals. In Section 3 the wideband DOA estimation of SBL for off-grid sources is introduced to the coprime array. No matter how fine the grid is, the true DOAs may be off the search grid. This off-grid problem can be well solved within sparse Bayesian framework. Section 4 presents numerical simulations showing that the DOA estimation for wideband signals using SBL has good performance in detection and estimation compared to least absolute shrinkage and selection operator (LASSO), SOMP-LS, SOMP-TLS and off-grid sparse Bayesian inference (OGSBI) based on coprime array. Section 5 concludes this paper.

2. Wideband Signal Model for Coprime Array

Consider a coprime array which is comprised of two uniform linear arrays (ULAs) with N and $2M$ sensors, as shown in Figure 1a, where the inter-element spacing of the first subarray is $M\raisebox{1ex}{$\lambda $}\!\left/ \!\raisebox{-1ex}{$2$}\right.$ and that of the second subarray is $N\raisebox{1ex}{$\lambda $}\!\left/ \!\raisebox{-1ex}{$2$}\right.$ with $\lambda$ as the center wavelength of the signal. Assume that K far-field wideband sources $s_k\left(t\right),k=1,\dots ,K$, impinge on the coprime array with incident angles $\mathsf{\Theta }=\left[{\theta }_1,\dots ,{\theta }_K\right]$. Therefore, the signal observed at the n-th sensor of the coprime array can be expressed as

$$x_n\left(t\right)=\sum _{k=1}^k{s}_k\left(t-{\tau }_n\left({\theta }_k\right)\right)+{\overline{n}}_n\left(t\right)$$

(1)

where $0\le n\le 2M+N-1,$ $s_k\left(t\right)$ is the kth signal, ${\overline{n}}_n\left(t\right)$ is the additive Gaussian white noise vector with the mean and variance equal to zero and ${\sigma }^2$ at the corresponding sensor and ${\tau }_n\left({\theta }_k\right)$ represents the time delay of the k-th impinging signal with the angle ${\theta }_k$ arriving at the n-th sensor of the coprime array. Then the L-point discrete Fourier transform (DFT) is applied to the observed sensor signal and in frequency domain the data vector received at the n-th sensor can be expressed as

$$X_n\left(l\right)=\sum _{i=0}^{L-1}{x}_n\left(i\right)e^{-j2\pi il/L}=\sum _{k=1}^K{S}_k\left(l\right)e^{-j2\pi f_s{\tau }_n\left({\theta }_k\right)l/L}+{\overline{N}}_n\left(l\right)$$

(2)

where $S_k\left(l\right)={\displaystyle \sum _{i=1}^{L-1}}{s}_k\left(t\right)e^{-j2\pi il/L}$ is the DFT of the k-th impinging signal $s_k\left(t\right)$ and ${\overline{N}}_n\left(l\right)$ is the DFT of the discrete time noise at n-th sensor of the coprime array. $l=1,\dots ,L,L\ge K$ and $f_s$ denotes the sampling frequency. The output signal model in the DFT domain can be written into

$$X\left(l\right)=A(l,\theta )S\left(l\right)+\overline{N}\left(l\right)$$

(3)

where $A(l,\theta )=\left[a\left(l,{\theta }_1\right),\dots ,a\left(l,{\theta }_K\right)\right]$ is the steering matrix.

The covariance matrix of data vector can be obtained as

$$R_l=E\left\{X\left(l\right)·X^H\left(l\right)\right\}=\sum _{k=1}^K{\sigma }_k^2\left(l\right)a\left(l,{\theta }_k\right)a^H\left(l,{\theta }_k\right)+{\sigma }_{\overline{n}}^2\left(l\right)I_{2M+N-1}$$

(4)

where $E\left\{·\right\}$ is the expection operator and ${\left\{·\right\}}^H$ is the Hermitian transpose operator. ${\sigma }_k^2\left(l\right)$ denotes the power of the k-th impinging signal, while ${\sigma }_{\overline{n}}^2\left(l\right)$ denotes the corresponding noise power. In practical situations, the theoretical covariance matrix $R_l$ is unavailable and the sample covariance matrix ${\widehat{R}}_l$ can be estimated using the T available segments (frequency snapshots) as

$$R_l\approx {\widehat{R}}_l=\frac{1}{T}\sum _{t=1}^{T}X\left(l,p\right)·X^H\left(l,p\right)$$

(5)

Then vectorizing $R_l$ in column and using kronecker product to obtain the following virtual array model

$$z_l=vec\left(R_l\right)=B_l{u}_l+{\sigma }_{\overline{n}}^2\left(l\right){\overline{I}}_{{(2M+N-1)}^2}$$

(6)

where $B_l=\left[b\left(l,{\theta }_1\right),\dots ,b\left(l,{\theta }_K\right)\right]$ with $b\left(l,{\theta }_k\right)=a^{*}\left(l,{\theta }_k\right)\otimes a\left(l,{\theta }_k\right)$, $u_l=\left[{\sigma }_1^2\left(l\right),\dots ,{\sigma }_K^2\left(l\right)\right]$ and ${\overline{I}}_{{(2M+N-1)}^2}=vec\left(I_{2M+N-1}\right)$ in which the symbol ${}^{\prime }{*}^{\prime }$ denotes complex conjugation, the symbol ${}^{\prime }{\otimes }^{\prime }$ denotes the Kronecker product and $vec\left(·\right)$ denotes the vectorization operation.

The locations of the sensors from the matrix $B_l$, regarded as the manifold matrix of a larger virtual array, are in the self-difference set

$$L_s=\left\{l_s\mid l_s=Nm,1\le m\le 2M-1\right\}\cup \left\{l_s\mid l_s=Mn,0\le n\le N-1\right\}$$

cross-difference set

$$L_c=\left\{\left(Mn-Nm\right),0\le n\le N-1,1\le m\le 2M-1\right\}$$

the corresponding mirrored self-difference set $L_s^{-}=\left\{-l_s\mid l_s\in L_s\right\}$ and the corresponding mirrored cross-difference set $L_c^{-}=\left\{-l_c\mid l_c\in L_c\right\}$ [25]. Therefore, the full set of lags from the larger virtual array is $L_p=L_s\cup L_s^{-}\cup L_c\cup L_c^{-}$. As a example of the coprime array with $M=3$ and $N=4$, Figure 1b shows the self-difference and cross-difference sets, while Figure 1c illustrates the full set of lags. Using the full set of lags, the resulting coarray can offer the higher number of DOFs to resolve more sources than the number of physical sensors.

3. Sparse Bayesian Learning with Off-Grid Sources

3.1. Off-Grid Formulation

It is assumed that there are $Q\le L$ DFT frequency bins indexed by $l_q,q=1,\dots ,Q$, which may or may not occupy the consecutive frequency bands within the bandwidth of signals. Then the manifold matrix $B_l$ corresponding to the Q frequency bins is $B_l=\left[B_{l_1},\dots ,B_{l_Q}\right].$ Sampling the potential spatial domain with D-element grid ${\theta }^g$ with fixed spacing $r^g={\theta }_{l+1}^g-{\theta }_l^g,1\le l\le D$ and discretizing the grid interval as ${\theta }_1^g,{\theta }_2^g,\dots ,{\theta }_D^g,D\gg K$, the virtual array model (6) can be written into

$$z_l=B_l^o{u}_l^o+{\sigma }_{\overline{n}}^2\left(l\right){\overline{I}}_{{(2M+N-1)}^2}$$

(7)

where $z_l=\left[z_{l_1},\dots ,z_{l_Q}\right]$, $B_l^o=\left[b\left(l,{\theta }_1^g\right),\dots ,b\left(l,{\theta }_D^g\right)\right]$ with $b\left(l,{\theta }_l^g\right)=a^{*}\left(l,{\theta }_l^g\right)\otimes a\left(l,{\theta }_l^g\right)$ and $u_l^o={\left[{\sigma }_1^2\left(l\right),\dots ,{\sigma }_D^2\left(l\right)\right]}^T$ which is a sparse vector, whose elements are all zeros except those corresponding to the true DOAs. No matter how fine the grid is, the true DOAs ${\theta }_k$, denoted as ${\theta }_k={\theta }_l^g+{\Delta }_l$ where ${\theta }_l^g\in {\theta }^g$ denotes the nearest grid corresponding to the ${\theta }_k$ and ${\Delta }_l\in \left[-\frac{r^g}{2}\frac{r^g}{2}\right]$ is the grid offset, may be off the dense search grid ${\theta }^g$. The steering vector $a\left(l,{\theta }_l^g+{\Delta }_l\right)$ at the actual angle ${\theta }_k$ can be approximately expressed as

$$a\left(l,{\theta }_l^g+{\Delta }_l\right)=a\left(l,{\theta }_l^g\right)\odot c\left(l,{\Delta }_l\right)$$

where $c\left(l,{\Delta }_l\right)={\left[1,e^{\frac{-j2\pi f_{l}M\lambda cos\left({\Delta }_l\right)}{2c}},\dots ,e^{\frac{-j2\pi f_{l}N\lambda \left(2M-1\right)cos\left({\Delta }_l\right)}{2c}}\right]}^T.$ Then the equivalent steering vector $b\left(l,{\theta }_l^g+{\Delta }_l\right)$ at the actual angle ${\theta }_k$ can be expressed as

$$\begin{array}{cc}\hfill b\left(l,{\theta }_l^g+{\Delta }_l\right)& =a^{*}\left(l,{\theta }_l^g+{\Delta }_l\right)\otimes a\left(l,{\theta }_l^g+{\Delta }_l\right)\hfill \\ & ={\left(a\left(l,{\theta }_l^g\right)\odot c\left(l,{\Delta }_l\right)\right)}^{*}\otimes \left(a\left(l,{\theta }_l^g\right)\odot c\left(l,{△}_l\right)\right)\hfill \\ & =\left(a^{*}\left(l,{\theta }_l^g\right)\otimes a\left(l,{\theta }_l^g\right)\right)\odot \left(c^{*}\left(l,{△}_l\right)\otimes c\left(l,{△}_l\right)\right)\hfill \end{array}$$

(8)

Denote the collection of D steering vectors as ${\tilde{B}}_l=\left[b\left(l,{\theta }_1^g+{△}_1\right),\dots ,b\left(l,{\theta }_D^g+{\Delta }_D\right)\right]$, the off-grid virtual array model can be given as

$$z_l=\widetilde{B_l}{u}_l^o+v_l$$

where $v_l$ denotes the vector comprising of all zeros except its k-th entry corresponding to the variance of the k-th element of the ${\overline{n}}_n\left(t\right)$.

3.2. Sparse Bayesian Learning Algorithm

Due to the noise being Gaussian, the likelihood can be expressed as

$$p\left(z_{l_q}\mid u_{l_q}^o;{\tilde{B}}_{l_q}\right)=\mathcal{CN}\left(z_{l_q}\mid {\tilde{B}}_{l_q}{u}_{l_q}^o,{\sigma }_{\overline{n}}^{2}I\right)$$

(9)

Since $u_{l_q}^o$ is real and nonnegative, Equation (9) can be converted to be the following real-valued likelihood form

$$p\left(y_{l_q}\mid u_{l_q}^o;{\tilde{B}}_{l_q}\right)=\mathcal{CN}\left(y_{l_q}\mid {\tilde{B}}_{l_q}{u}_{l_q}^o,{\sigma }_{\overline{n}}^{2}I\right)$$

(10)

where $y_{l_q}\stackrel{△}{=}{\left[Re\left(z_{l_q}^T\right),Im\left(z_{l_q}^T\right)\right]}^T$ and ${\tilde{B}}_{l_q}\stackrel{△}{=}{\left[Re\left({\tilde{B}}_{l_q}^T\right),Im\left({\tilde{B}}_{l_q}^T\right)\right]}^T$ [26]. Using the Gaussian distribution, the prior for $u_{l_q}^o$ can be expressed as

$$p\left(u_{l_q}^o;{\gamma }_{l_q}\right)=\mathcal{CN}\left(u_{l_q}^o\mid 0,{\mathsf{\Gamma }}_{l_q}\right)=\mathcal{CN}\left(u_{l_q}^o\mid 0,diag\left({\gamma }_{l_q}\right)\right)=\prod _{m=1}^D\mathcal{CN}\left(u_{l_q,m}^o\mid 0,{\gamma }_{l_q,m}\right)$$

where ${\mathsf{\Gamma }}_{l_q}=diag\left({\gamma }_{l_q,1},\dots ,{\gamma }_{l_q,D}\right)=diag\left({\gamma }_{l_q}\right)$ is the diagonal covariance of the source amplitudes with the vector ${\gamma }_{l_q}$ as the source power in each range-depth cell $\theta$.

Let $Y_{l_q}=\left[y_{1_q},\dots ,y_{L_q}\right]$ denote the collection of T snapshots and the corresponding collection of source variance vectors be denoted as $U_{l_q}^o$, respectively. Using Equation (10), the multi snapshot likelihood can be expressed as

$$p\left(Y_{l_q}\mid U_{l_q}^o\right)=\prod _{t=1}^{T}p\left(y_{l_q,t}\mid u_{l_q,t}^o\right)$$

The multi frequency likelihood can be expressed as

$$p\left(Y_{l_{1:Q}}\mid U_{l_{1:Q}}^o\right)=\prod _{q=1}^Q\prod _{t=1}^{T}p\left(y_{l_q,t}\mid u_{l_q,t}^o\right)$$

The evidence $p\left(Y_{l_q}\right)$ can be obtained by averaging over all realizations of $U_{l_q}^o$ as

$$\begin{array}{cc}\hfill p\left(Y_{l_q}\right)& =\int p\left(Y_{l_q}\mid U_{l_q}^o\right)p\left(U_{l_q}^o\right)d{U}_{l_q}^o=\int \prod _{t=1}^T\mathcal{CN}\left(y_{l_q,t};{\tilde{B}}_{l_q}{u}_{l_q,t}^o,{\sigma }_{\overline{n}}^{2}I\right)\mathcal{CN}\left(u_{l_q,t}^o;0,{\mathsf{\Gamma }}_{l_q}\right)\hfill \\ & =\prod _{t=1}^T\mathcal{CN}\left(y_{l_q,t};0,{\sigma }_{\overline{n}}^{2}I+{\tilde{B}}_{l_q}{\mathsf{\Gamma }}_{l_q}{\tilde{B}}_{l_q}^H\right)=\prod _{t=1}^T\mathcal{CN}\left(y_{l_q,t};0,{\sum }_{y_{l_q}}\right)\hfill \end{array}$$

(11)

where ${\sum }_{y_{l_q}}={\sigma }_{\overline{n}}^{2}I+{\tilde{B}}_{l_q}{\mathsf{\Gamma }}_{l_q}{\tilde{B}}_{l_q}^H$. To estimate ${\gamma }_{l_q}$ which denotes $\widehat{{\gamma }_{l_q}}$, we maximize the joint evidence

$${\widehat{\gamma }}_{l_{1:Q}}=\underset{{\gamma }_{l_{1:Q}}}{argmaxp\left(Y_{l_{1:Q}}\right)=}\underset{{\gamma }_{l_{1:Q}}}{argmin}\left\{\sum _{q=1}^{Q}Tlog\mid {\sum }_{y_{l_q}}\mid +Tr\left(Y_{l_q}^H{\sum }_{y_{l_q}}^{-1}{Y}_{l_q}\right)\right\}$$

where $Tr\left(\right)$ denotes the trace of a matrix and $\mid ·\mid$ denotes the determinant of a matrix. To get the minimum of this objection function, we equate the derivative of the objection function to zero

$$\frac{\partial }{\partial {\gamma }_{l_q,m}}\left\{\sum _{q=1}^{Q}Tlog\mid {\sum }_{y_{l_q}}\mid +Tr\left(Y_{l_q}^H{\sum }_{y_{l_q}}^{-1}{Y}_{l_q}\right)\right\}=0$$

$${\widehat{\gamma }}_m^{new}={\widehat{\gamma }}_m^{old}\frac{{\displaystyle \sum _{q=1}^Q}\parallel Y_{l_q}^H{\sum }_{y_{l_q}}^{-1}\tilde{b}\left(l_q,m\right){\parallel }_2^2}{T{\displaystyle \sum _{q=1}^Q}{\tilde{b}}^H\left(l_q,m\right){\sum }_{y_{l_q}}^{-1}\tilde{b}\left(l_q,m\right)}$$

(12)

where $\tilde{b}\left(l_q,m\right)={\left[Re\left(b^T\left(l_q,m\right)\right),Im\left(b^T\left(l_q,m\right)\right)\right]}^T$. If the sparsity is the same with different frequencies, the estimate of $\widehat{{\gamma }_{l_q}}$ correspond to the source variance at the q-th frequency bin. Denote ${\tilde{B}}_{\mathcal{M}}$ the matrix formed by K columns of $\tilde{B}$ indexed by $\mathcal{M}$, where the set $\mathcal{M}$ signifies the location of the non-zero entries of $\gamma$ with cardinality $\mid \mathcal{M}\mid =K$. The variance of noise ${\sigma }_{\overline{n}}^2$ can be expressed as

$${\sigma }_{\overline{n}}^2=\frac{1}{D-K}Tr\left(\left(I_D-{\tilde{B}}_{l,\mathcal{M}}{\tilde{B}}_{l,\mathcal{M}}^{+}\right){\tilde{R}}_l\right)$$

(13)

where ${\tilde{B}}_{\mathcal{M}}^{+}$ denotes the Moore-Penrose pseudo-inverse of the matrix ${\tilde{B}}_{\mathcal{M}}$ and ${\tilde{R}}_l=R_l^T\otimes R_l/T$ [17].

In short, the SBL algorithm can be summarized as follows:

Step 1.

Initialization: $ϵ={10}^{-4}$, ${\gamma }_m^{old}=1$, ${\sigma }_{\overline{n}}^2=0.1$, $N_t=1$

Step 2.

Input $y_l$ with $y_l=\left[y_{l_1},\dots ,y_{l_Q}\right]$ and ${\tilde{B}}_l$ with ${\tilde{B}}_l=\left[{\tilde{B}}_{l_1},\dots ,{\tilde{B}}_{l_Q}\right]$, then compute ${\sum }_{y_l}={\sigma }_{\overline{n}}^{2}I+{\tilde{B}}_l{\mathsf{\Gamma }}_l{\tilde{B}}_l^H$

Step 3.

Update ${\gamma }_m^{new}$ according to Equation (12)

Step 4.

Update ${\sigma }_{\overline{n}}^2$ according to Equation (13)

Step 5.

If $\frac{\parallel {\gamma }^{new}-{\gamma }^{old}{\parallel }_1}{\parallel {\gamma }^{new}{\parallel }_1}<ϵ$, stop

Step 6.

let ${\gamma }^{old}={\gamma }^{new}$ and $N_t=N_t+1$

Step 7.

If $N_t<1000$, go to step 2; otherwise stop.

4. Simulation Result

In this section, we carry out simulations to illustrate the performance of SBL with the coprime array for wideband DOA estimation, and also compare it with other state-of-the-art algorithms, including LASSO, SOMP-LS, SOMP-TLS [27] and OGSBI [28]. In the simulations, the fractional bandwidth, which is the ratio of bandwidth divided by the center frequency, is $2/3$ for signals. The sampling frequency is three times the highest frequency. In other words, the signals have a normalized frequency range from $(1/3)\pi$ to $(2/3)\pi$, where the normalized frequency can be defined as $\omega =\frac{2f}{f_s}\pi$ with f being the frequency of interest. Considering the signals at each frequency bin sharing the same distribution, i.e., the amplitude being a Rayleigh random variable and the phase being uniformly distributed on $\left[-\pi ,\pi \right]$. $L=128$-point DFT is applied and the frequency band of interest covers $Q=26$ frequency bins. Assume that an example of $K=12$ signals with their off-grid impinging angles uniformly distributed between $-\raisebox{1ex}{$\pi $}\!\left/ \!\raisebox{-1ex}{$3$}\right.$ and $\raisebox{1ex}{$\pi $}\!\left/ \!\raisebox{-1ex}{$3$}\right.$. The coprime array consists of a pair of sparse ULAs with $M=3$ and $N=4$, and in total there are 9 physical sensors considered with the position set $S=\left[0,3,4,6,8,9,12,16,20\right]\raisebox{1ex}{$\lambda $}\!\left/ \!\raisebox{-1ex}{$2$}\right.$. A search grid of $K_g=\frac{2\pi }{r}$ potential angles corresponding to a step size $r=1$ is generated with the full angle range from $-\frac{\pi }{2}$ to $\frac{\pi }{2}$.

First, we compare the detection performance of SBL with that of LASSO, SOMP-TLS and OGSBI. Within the entire frequency band of interest the signal power and the noise power are used to calculate the SNR. Assume that $K=12$ wideband signals impinge on the coprime array with $M=3$ and $N=4$, the number of snapshots is 100 and the input SNR is fixed to be 0 dB. In Figure 2, the solid lines represent the estimation of DOAs, while the dotted lines represent the actual incident angles of source signals. As shown in Figure 2, all wideband signals (more than the number of physical sensors) can be distinguished successfully by LASSO, SOMP-TLS, OGSBI and SBL. However, LASSO and OGSBI may generate some spurious peaks for sources. There is no spurious peaks with the performance of SOMP-TLS compared to the other methods, even SBL has one spurious peak at 0.5 rad. Also, for some angles SOMP-TLS provides closer DOA estimates to the true values compared to SBL, whereas SBL gives better accuracy for the other angles. Therefore, the estimation performance using SBL and SOMP-TLS methods are comparable and provide the best detection among the other methods.

Next, we compare the separation ability of SBL with that of LASSO, SOMP-LS, SOMP-TLS and OGSBI in the statistical sense for SNR. For each angle separation of the signals, the separation ability of all algorithms are derived from 200 trials. Assume $\Delta \theta =0.0952$ rad as half of the two closely incident signals, successful separation of LASSO, SOMP-LS, SOMP-TLS, OGSBI and SBL is defined if the estimated DOA of each signal satisfies ${\theta }_k-\Delta \theta \le \widehat{{\theta }_k}\le {\theta }_k+\Delta \theta$. In other words, we carry out the criteria, the DOA estimation biases of each signal do not exceed $\Delta \theta$, for separation evaluation. Assume that $K=12$ wideband signals as in the first experiment impinge on the coprime array with $M=3$ and $N=4$, the number of snapshots is fixed to be 200 and the SNR is varied from −20 dB to 20 dB for each trial. Figure 3 illustrates the separation performance based on the coprime array for LASSO, SOMP-LS, SOMP-TLS and OGSBI. It is evident that SBL performs best compared to LASSO, SOMP-LS, SOMP-TLS and OGSBI.

Finally, the estimation performance of SBL is conducted to evaluate the estimation accuracy in comparison with that of LASSO, SOMP-LS, SOMP-TLS and OGSBI in terms of the root mean square error (RMSE). The empirical RMSE of the estimated DOAs, defined as $RMSE=\sqrt{{\displaystyle \sum _{i=1}^W}{\displaystyle \sum _{k=1}^k}{({\widehat{\theta }}_k(i)-{\theta }_k)}^2}$, where W is the number of independent Monte Carlo trials and ${\widehat{\theta }}_k\left(i\right)$ is the estimate of ${\theta }_k$ in the ith Monte Carlo trial, is used to evaluate the simulation performance. Here each testing point is based on an average of results by 200 iterations of Monte Carlo simulations. Assume that $K=12$ wideband signals as in the first experiment impinge on the coprime array with $M=3$ and $N=4$ for each iteration. Crame-Rao lower bound (CRLB) [29,30,31,32,33], which offers a lower bound on the variances of estimation accuracy, is also used to indicate the ideal estimation.

Figure 4a depicts the RMSE of LASSO, SOMP-LS, SOMP-TLS, OGSBI and SBL versus SNR for wideband signals based on coprime array with the number of snapshots $T=200$. It is clear that the DOA estimation performance is improved with the increase of SNR for all algorithms. Note that the RMSE of the SBL is the lowest compared to that of LASSO, SOMP-LS, SOMP-TLS and OGSBI. Therefore, the performance of SBL outperforms LASSO, SOMP-LS, SOMP-TLS and OGSBI when SNR is varied from −20 dB to 20 dB. The reason is that the all-on-grid assumption severely degrades the performance of LASSO, but SBL can efficiently alleviate the off-grid mismatch problem.

Figure 4b plots the RMSE of LASSO, SOMP-LS, SOMP-TLS, OGSBI and SBL versus the number of snapshots for wideband signals based on coprime array with $SNR=0$ dB. Due to the rate of successful detection using SOMP-LS and SOMP-TLS be 27% when $T=10$, their RMSE values are considered from $T=20$. It can be readily observed that the estimation performance is to be increased as the number of snapshots is increasing for all algorithms. As shown in Figure 4b, SBL can obtain more accurate estimation performance by increasing the number of snapshots in comparison with LASSO, SOMP-LS, SOMP-TLS and OGSBI. Therefore, the superiority of the off-grid mismatch for SBL is demonstrated.

5. Conclusions

In this paper, by exploiting SBL for the underdetermined DOA estimation of wideband signals based on the coprime array, we find that the SBL can achieve superior detection performance and estimation accuracy in comparison to LASSO, SOMP-LS, SOMP-TLS and OGSBI. The SBL can accommodate the increased DOFs provided by the coprime array to perform the effective underdetermined wideband DOA estimation for off-grid sources. The SBL employs fixed point updates to give global convergence properities for wideband DOA estimation. Numerical experiments are used to demonstrate the superiority of the SBL in detection and estimation performance with the coprime array for underdetermined wideband DOA estimation.