A Low-Complexity ESPRIT-Based DOA Estimation Method for Co-Prime Linear Arrays

Abstract

The problem of direction-of-arrival (DOA) estimation is investigated for co-prime array, where the co-prime array consists of two uniform sparse linear subarrays with extended inter-element spacing. For each sparse subarray, true DOAs are mapped into several equivalent angles impinging on the traditional uniform linear array with half-wavelength spacing. Then, by applying the estimation of signal parameters via rotational invariance technique (ESPRIT), the equivalent DOAs are estimated, and the candidate DOAs are recovered according to the relationship among equivalent and true DOAs. Finally, the true DOAs are estimated by combining the results of the two subarrays. The proposed method achieves a better complexity–performance tradeoff as compared to other existing methods.

1. Introduction

Direction of arrival (DOA) estimation is a crucial problem in various applications, such as radar, sonar, and wireless communications [1]. Various DOA estimation methods have been studied in uniform linear arrays (ULAs), including multiple signal classification (MUSIC) [2] and estimation of signal parameters via rotational invariance technique (ESPRIT) [3]. In [4], a Khatri-Rao product-based real-valued sparse estimation method is proposed. With respect to the random errors of sensor position, a stochastic framework is established to find the probability density function of the DOA-estimates [5]. However, most of the traditional DOA estimation schemes have focused on ULA structure [6], which, in fact, is not an optimal array geometry.

Recently, sparse array geometry has drawn lots of attention due to its high resolution [7,8,9]. An eigenstructure-based direction-finding algorithm is proposed in [7] for sparse uniform Cartesian arrays. In [8], an ESPRIT-based estimation method is proposed for a sparse array with two different sizes of spatial invariances. Moreover, the literature [9] introduces a novel direction-finding algorithm for a multiscale sensor array, which presents multiple scales of spatial invariance. Except for these sparse structures, the nested arrays [10] and co-prime arrays [11,12,13] have also attracted great attention. The nested array suffers from the mutual coupling problem due to some closely located sensors, while the co-prime array has less of a mutual coupling effect since sensor elements are sparsely located. Consequently, we consider the co-prime array structure in this paper. Various DOA estimation methods have been proposed for co-prime arrays [14,15,16]. A projection-like method is proposed in [14] to estimate DOAs by combining the results of the two subarrays. By applying the MUSIC algorithm, a total spectral search-based method (TSS) is proposed in [15], which, however, suffers from the high complexity caused by the spectral search step. By limiting the searching region to a small sector, a partial spectral search-based method (PSS) is proposed in [16]. It is shown in [16] that the PSS method can achieve almost the same estimation accuracy as TSS, but with a substantially reduced complexity. Further, the PSS method is extended to co-prime planar array structures to estimate two dimensional DOAs in [17]. However, since the complexity is mainly caused by spectral search, the works [16,17] still have a heavy computational burden.

To this end, in this paper, we propose a low-complexity DOA estimation method for co-prime linear arrays. For each subarray of the co-prime array, the true DOAs are mapped into their respective equivalent angles impinging on a traditional ULA with half-wavelength inter-element spacing, which can be the obtained by ESPRIT. Then, according to the relationship among true and equivalent DOAs, the candidate DOAs are recovered immediately. Finally, the true DOAs can be uniquely estimated by seeking the common angles recovered by the two subarrays. Simulation results are provided to verify the effectiveness of the proposed method.

2. System Model

As shown in Figure 1, we consider a co-prime linear array consisting of two uniform linear subarrays, which are located in the same line. The first subarray has $M_1$ equal-spaced omnidirectional sensors with inter-element spacing $M_2\lambda /\phantom{\lambda 2}2$, while the second has $M_2$ equal-spaced omnidirectional sensors with inter-element spacing $M_1\lambda /\phantom{\lambda 2}2$. Here $M_1$ and $M_2$ are co-prime integers, and λ is the wavelength. The two subarrays share the first sensor, and consequently the co-prime array has $M_1+M_2-1$ sensors.

Assume $K(K<min\left(M_1,M_2\right))$ uncorrelated narrowband signals impinge on the array. The received signal for the ith (i = 1, 2) subarray at time $t\left(1\le t\le T\right)$ is

$${\mathbf{x}}_i\left(t\right)=\sum _{k=1}^K{\mathbf{a}}_i\left({\theta }_k\right)s_k\left(t\right)={\mathbf{A}}_i\mathbf{s}\left(t\right)+{\mathbf{n}}_i\left(t\right)$$

(1)

where ${\mathbf{a}}_i\left({\theta }_k\right)={\left[1,e^{-j{M}_{\tilde{i}}\pi sin\left({\theta }_k\right)}\dots ,e^{-j\left(M_i-1\right)M_{\tilde{i}}\pi sin\left({\theta }_k\right)}\right]}^T$($i+\tilde{i}=3$) is the steering vector for the kth source ${\theta }_k$, ${\mathbf{A}}_i=\left[{\mathbf{a}}_i\left({\theta }_1\right),\dots ,{\mathbf{a}}_i\left({\theta }_K\right)\right]$ is the steering matrix, $\mathbf{s}\left(t\right)={\left[s_1\left(t\right),\dots ,s_K\left(t\right)\right]}^T$ is the source vector. The components of ${\mathbf{n}}_i\left(t\right)$ are assumed to be independent and identically distributed additive white Gaussian noise with equal variance in each sensor, and are independent from the sources. ${\left(·\right)}^T$ denotes the transpose operation.

According to the property of sinusoid function, for each source ${\theta }_k$ in the ith subarray, there exist some particular angles, denoted as ${\theta }_{i,k}^{eqv}$, that satisfy $\pi sin{\theta }_{i,k}^{eqv}=M_{\tilde{i}}\pi sin{\theta }_k+2n_i\pi$, where $n_i$ is an integer. From the definition of ${\mathbf{a}}_i\left({\theta }_k\right)$, the angle ${\theta }_{i,k}^{eqv}$ can be regarded as the equivalent angle for the true ${\theta }_k$ impinging on one traditional $M_i$-element ULA with half-wavelength spacing, which generates the same steering vector as ${\theta }_k$. The relation between true ${\theta }_k$ and its equivalent ${\theta }_{i,k}^{eqv}$ is thus given as

$$sin{\theta }_{i,k}^{eqv}=M_{\tilde{i}}sin{\theta }_k+2n_i$$

(2)

The signal model in Equation (1) amounts to K equivalent sources from angles ${\theta }_{i,k}^{eqv}$ impinging on a traditional ULA simultaneously. The system model of the ith subarray of the co-prime array and its equivalent uniform linear array is shown in Figure 2.

3. Proposed DOA Estimation Method

The equivalent DOA equals to the true one only when $M_{\tilde{i}}=1$. In the considered co-prime array, since $M_{\tilde{i}}>1$, there exist multiple equivalent angles ${\theta }_{i,k}^{eqv}$ for each true ${\theta }_k$. The true DOA ${\theta }_k$ may be one of the potential equivalent angles recovered by Equation (2), however, which one is the true DOA cannot be determined by each subarray alone. According to the property of coprimeness, the true DOAs can be uniquely estimated by finding the common angles in the two equivalent DOA sets generated by the two subarrays, respectively.

In the following, we aim to find the equivalent DOAs from Equation (1). To avoid the high complexity caused by spectral search, we propose to use the ESPRIT method.

3.1. Proposed Method

The steering matrix ${\mathbf{A}}_i$ of the ith subarray can be rewritten as

$${\mathbf{A}}_i=\left[\begin{array}{c}{\mathbf{A}}_{i,1}\\ \mathrm{the}\mathrm{last}\mathrm{row}\end{array}\right]=\left[\begin{array}{c}\mathrm{the}\mathrm{first}\mathrm{row}\\ {\mathbf{A}}_{i,2}\end{array}\right]$$

(3)

where ${\mathbf{A}}_{i,1}$ is the first $M_i-1$ rows of ${\mathbf{A}}_i$ and ${\mathbf{A}}_{i,2}$ is constructed from the last $M_i-1$ rows. The relationship between ${\mathbf{A}}_{i,1}$ and ${\mathbf{A}}_{i,2}$ is

$${\mathbf{A}}_{i,2}={\mathbf{A}}_{i,1}\mathbf{J}$$

(4)

with $\mathbf{J}=\mathrm{diag}\left(e^{-j\pi sin{\theta }_{i,1}^{eqv}},e^{-j\pi sin{\theta }_{i,2}^{eqv}},\cdots ,e^{-j\pi sin{\theta }_{i,K}^{eqv}}\right)$.

The eigen-decomposition of the array covariance matrix ${\mathbf{R}}_i=E\left[{\mathbf{x}}_i\left(t\right){\mathbf{x}}_i^H\left(t\right)\right]$ of the ith subarray yields

$${\mathbf{R}}_i={\mathbf{U}}_{s,i}{\mathsf{\Lambda }}_s{\mathbf{U}}_{s,i}^H+{\mathbf{U}}_{n,i}{\mathsf{\Lambda }}_n{\mathbf{U}}_{n,i}^H$$

(5)

Here $E\left(·\right)$ and ${\left(·\right)}^H$ stand for statistical expectation and Hermitian transpose, respectively. ${\mathbf{U}}_{s,i}$ and ${\mathbf{U}}_{n,i}$ denote the signal- and noise-subspace eigenvectors, respectively. ${\mathsf{\Lambda }}_s$ and ${\mathsf{\Lambda }}_n$ contain the corresponding eigenvalues.

The signal subspace eigenvector ${\mathbf{U}}_{s,i}$ can be similarly partitioned as

$${\mathbf{U}}_{s,i}=\left[\begin{array}{c}{\mathbf{U}}_{s,i,1}\\ \mathrm{the}\mathrm{last}\mathrm{row}\end{array}\right]=\left[\begin{array}{c}\mathrm{the}\mathrm{first}\mathrm{row}\\ {\mathbf{U}}_{s,i,2}\end{array}\right]$$

(6)

where ${\mathbf{U}}_{s,i,1}={\mathbf{A}}_{i,1}\mathbf{G}$, ${\mathbf{U}}_{s,i,2}={\mathbf{A}}_{i,2}\mathbf{G}={\mathbf{A}}_{i,1}\mathbf{JG}$, and $\mathbf{G}$ is a full rank $K\times K$ matrix. Then, we have

$${\mathbf{G}}^{-1}\mathbf{JG}={\left({\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,1}\right)}^{-1}{\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,2}$$

(7)

The matrix ${\left({\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,1}\right)}^{-1}{\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,2}$ has the same eigenvalues as $\mathbf{J}$, while $\mathbf{J}$ contains the information of the equivalent DOAs. The equivalent DOAs can then be obtained by finding the eigenvalues of the matrix ${\left({\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,1}\right)}^{-1}{\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,2}$. Specifically, assume the K eigenvalues are denoted as $d_k(k=1,2,\dots ,K)$, the equivalent DOAs of the ith subarray can be estimated as

$${\widehat{\theta }}_{i,k}^{eqv}=\mathrm{arc}sin\left(d_k/\phantom{d_k\pi }\pi \right)$$

(8)

Let ${\widehat{\mathbf{\theta }}}_i^{eqv}=\left[{\widehat{\theta }}_{i,1}^{eqv},{\widehat{\theta }}_{i,2}^{eqv},\cdots ,{\widehat{\theta }}_{i,K}^{eqv}\right]$. The candidate true DOAs can be recovered by Equation (2); i.e.,

$${\widehat{\mathbf{\theta }}}_i^{cand}=arcsin\left(\frac{1}{M_{\tilde{i}}}\left(sin{\widehat{\mathbf{\theta }}}_i^{eqv}-2n_i\right)\right)$$

(9)

Here the relationship $-M_{\tilde{i}}\le \left(sin{\widehat{\mathbf{\theta }}}_i^{eqv}-2n_i\right)\le M_{\tilde{i}}$ must hold due to the constraint of the sinusoid function. Hence, the set ${\widehat{\mathbf{\theta }}}_i^{cand}$ contains $M_{\tilde{i}}\times K$ candidate DOAs, among which only K angles are true. According to the coprimeness of $M_1$ and $M_2$, the true DOAs are obtained by finding the K common angles of the two candidate sets ${\widehat{\mathbf{\theta }}}_1^{cand}$ and ${\widehat{\mathbf{\theta }}}_2^{cand}$. In practice, due to the effect of noise, the true DOAs are estimated by seeking for the nearest angle pairs.

Remark 1. 

The two candidate sets ${\widehat{\mathbf{\theta }}}_1^{cand}$ and ${\widehat{\mathbf{\theta }}}_2^{cand}$ both contain the K true DOAs. In particular cases, except for true DOAs, they may have some other common angles (e.g., the candidate DOAs of different sources in different subarrays may have common angles). This may generate more than K common angles and cause ambiguity as a result. Without loss of generality, we consider $K=2$ sources, denoted as ${\theta }_1$ and ${\theta }_2$. Let ${\theta }_c$ both exist in the candidate set of source 1 in the ith subarray and the candidate set of source 2 in the $\tilde{i}\mathrm{th}$ subarray; i.e., except for ${\theta }_1$ and ${\theta }_2$, they generate another common angle. The relations are denoted as

$$\begin{array}{c}\left\{\begin{array}{c}sin{\theta }_c=sin{\theta }_1+\frac{2m_{\tilde{i}}}{M_{\tilde{i}}}\hfill \\ sin{\theta }_c=sin{\theta }_2+\frac{2m_i}{M_i}\hfill \end{array}\right.\hfill \end{array}$$

(10)

where $m_{\tilde{i}}$ and $m_i$ are integers. Then we have the relation between ${\theta }_1$ and ${\theta }_2$ as

$$sin{\theta }_1-sin{\theta }_2=\frac{2m_i}{M_i}-\frac{2m_{\tilde{i}}}{M_{\tilde{i}}}$$

(11)

It is observed from Equation (11) that only when $m_i\ne 0$ and $m_{\tilde{i}}\ne 0$, the particular $\left({\theta }_1,{\theta }_2\right)$ pair will generate another common angle. For example, let us consider a co-prime linear array with $M_1=5$ and $M_2=7$ and assume ${\theta }_1={60.0}^{°}$ and ${\theta }_2={48.7}^{°}$. The two DOAs satisfy the relationship (11). The corresponding ambiguous DOAs generated by each subarray are listed in

Table 1. Two directions of arrival (DOAs) and their corresponding ambiguous DOAs in each subarray.

${\theta }_1={60.0}^{°}$	Subarray 1 with $M_1=5$	−58.0,   −34.2,   −16.1,   0.51,   17.1,   35.5,   60.0
	Subarray 2 with $M_2=7$	−47.2,   −19.5,   3.8,   27.8,   60.0
${\theta }_2={48.7}^{°}$	Subarray 1 with $M_1=5$	−74.4,   −42.6,   −23.1,   −6.1,   10.4,   27.8,   48.7
	Subarray 2 with $M_2=7$	−58.0,   −26.7,   −2.8,   20.6,   48.7

. As can be seen, for each source, the estimate of the two subarrays can generate one unique common angle—i.e., the true DOA. However, when the two sources (${\theta }_1={60.0}^{°}$ and ${\theta }_2={48.7}^{°}$) are considered, expect for true DOAs, the estimate of the two subarrays may generate another two common angles (i.e., $-{58.0}^{°}$ and ${27.8}^{°}$). This violates the uniqueness and causes ambiguity as a result.

However, notice that the incident DOAs are in the continuous range between $-{90}^{°}$ and ${90}^{°}$, and only some particular angle pairs $\left({\theta }_1,{\theta }_2\right)$ that satisfy Equation (11) may generate another common ambiguous angle, except for the true DOAs. Specifically, for arbitrarily given ${\theta }_1$, only some discrete angles for ${\theta }_2$ follow the relationship Equation (11). Therefore, as compared to the continuous angle range, the number of $\left({\theta }_1,{\theta }_2\right)$ pairs that satisfy Equation (11) is rare. Therefore, the probability of the existence of a different common angle ${\theta }_c$ approaches zero and it is consequently a small probability event. Even if this small probability event happens, it can be solved by the entire co-prime linear array. The beamforming-related techniques, such as the classical beamforming approach (CBF) [18] and the Capon’s approach (also known as the minimum variance distortionless response, MVDR) [19,20], can be utilized to eliminate the problem. Specifically, the CBF spatial spectrum of the entire co-prime array is

$$P_{CBF}={\mathbf{a}}_C^H\left(\theta \right){\mathbf{R}}_C{\mathbf{a}}_C\left(\theta \right)$$

(12)

and the MVDR spatial spectrum is

$$P_{MVDR}=\frac{1}{{\mathbf{a}}_C^H\left(\theta \right){\mathbf{R}}_C^{-1}{\mathbf{a}}_C\left(\theta \right)}$$

(13)

where ${\mathbf{a}}_C\left(\theta \right)$ denotes the steering vector with respect to θ of the entire co-prime array, and ${\mathbf{R}}_{\mathbf{C}}$ is the covariance matrix of the entire co-prime array. By finding the peaks of $P_{CBF}$ in Equation (12) or $P_{MVDR}$ in Equation (13) the true DOAs can be estimated, and other ambiguous angles are eliminated. Thus, the ambiguity can be resolved successfully.

Remark 2. 

In general, there exist K common angles, which are the true DOAs. However, if the incident angles satisfy Equation (11), more than K common angles can be generated. We need to determine the number $\widehat{K}$ ($\widehat{K}\ge K$) of the common angles. Let $N_1$ and $N_2$, respectively, denote the numbers of the relevant angles (including the true and ambiguous angles) for the first and second subarray, and let $d_i$ denote the absolute value of angle difference, where $1\le i\le N_1{N}_2$. By sorting $d_i$ in ascendant order, we have

$$d_1\le d_2\le \cdots \le d_K\le \cdots \le d_{N_1{N}_2}$$

(14)

For common angles of the two subarrays, the angle differences are small (nearly 0), while they become larger for distinct angles. Define a decision variable as

$$D\left(n\right)=\frac{d_{n+1}-d_n}{d_n},n=K,K+1,\cdots ,N_1{N}_2-1$$

(15)

Notice that when both $d_n$ and $d_{n+1}$ are the differences of common angles or distinct angles, the decision variable will almost keep small. Meanwhile, if $d_n$ is the difference of common angles and $d_{n+1}$ is the difference of distinct angles, the decision variable will become much larger. Thus, the number of common angles can be estimated as

$$\widehat{K}=arg\underset{n}{max}D\left(n\right)$$

(16)

When $\widehat{K}>K$, the true K DOAs can be distinguished according to Equations (12) and (13).

3.2. Complexity Analysis

The complexity of different methods is provided in

Table 2. Computational complexity comparison.

ESPRIT	$\mathcal{O}\left(M^{2}T+M^3+3M{K}^2+2K^3\right)$
PSS [16]	$\mathcal{O}\left(\left(M_1^2+M_2^2\right)T+M_1^3+M_2^3+\frac{J}{M_2}{M}_1\left(M_1-K\right)+\frac{J}{M_1}{M}_2\left(M_2-K\right)\right)$
Proposed	$\mathcal{O}\left(\left(M_1^2+M_2^2\right)T+M_1^3+M_2^3+3\left(M_1+M_2\right)K^2+4K^3\right)$

Note: $M=M_1+M_2-1$, J is the number of sampling points. PSS: partial spectral search.

. The ESPRIT method with M sensors and K sources requires covariance matrix estimation and the eigen-decomposition of both the covariance matrix ${\mathbf{R}}_i$ and the matrix ${\left({\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,1}\right)}^{-1}{\mathbf{U}}_{s,i,1}^H{\mathbf{U}}_{s,i,2}$, and the corresponding complexities are $\mathcal{O}\left(M^{2}T\right)$, $\mathcal{O}\left(M^3\right)$, and $\mathcal{O}\left(3M{K}^2+2K^3\right)$, respectively. The resulting complexity of ESPRIT is given as $\mathcal{O}\left(M^{2}T+M^3+3M{K}^2+2K^3\right)$. The complexity of the proposed method is given similarly. As is shown in Table 2, the complexity of the proposed method is lower than that of ESPRIT.

4. Results

In this section, we compare the proposed method with PSS [16] in co-prime arrays with $M_1=5$ and $M_2=7$. For fair comparison, the results of the traditional ESPRIT are also provided for two types of half-wavelength spacing ULAs with $M_1$ + $M_2$ − $1=11$ and $M_1{M}_2$ − min$\left(M_1,M_2\right)$ + $1=31$ sensors, respectively. The former has the same sensor number as the considered co-prime array, but with less aperture length, denoted as ESPRIT with the same sensor number (ESPRIT-SSN). The latter has the same aperture length, but with more sensor elements, denoted as ESPRIT with the same aperture length (ESPRIT-SAL). The Cramer-Rao bound (CRB) for the co-prime array geometry is also given as a benchmark [21]. The searching grid for PSS is set as ${0.1}^{°}$.

In the first test, we compare the average root mean square error (RMSE) of different methods. Two uncorrelated sources are assumed to impinge on the array from directions ${21}^{°}$ and ${41}^{°}$. Figure 3 plots the RMSE performance versus signal-to-noise ratio (SNR) via 200 Monte Carlo simulations with $T=200$. As is shown, under the same sensor number condition, the proposed method outperforms ESPRIT-SSN greatly. With respect to the same aperture length, the proposed method can achieve almost the same estimation accuracy as ESPRIT-SAL. The proposed method is inferior to PSS at low SNR, and gradually exceeds PSS with the increase of SNR. Regarding the complexity, the ESPRIT-SSN, ESPRIT-SAL, PSS, and proposed method requires $\mathcal{O}\left(2.57\times {10}^4\right)$, $\mathcal{O}\left(2.22\times {10}^5\right)$, $\mathcal{O}\left(3.17\times {10}^4\right)$, and $\mathcal{O}\left(1.55\times {10}^4\right)$ complexities, respectively. The average running time for the four methods are 5.74 s, 15.60 s, 12.98 s, and 2.66 s. The complexity of the proposed method is lower than that of others, implying that the proposed method needs less memory. Especially, to achieve the same estimation accuracy, the proposed method only requires about 10% computational complexity as compared to ESPRIT-SAL. Therefore, the proposed method can achieve a better complexity–performance tradeoff. Further, Figure 4 depicts the RMSE performance versus snapshot number with SNR = 5 dB. The performance of the proposed method is almost the same as ESPRIT-SAL and is superior to ESPRIT-SSN, but is slightly weaker than that of PSS. However, the performance gap becomes smaller with the increase of snapshot number.

In the second test, we investigate the resolution probability performance. The two sources are said to be resolvable [22] if both $\left|{\widehat{\theta }}_1-{\theta }_1\right|$ and $\left|{\widehat{\theta }}_2-{\theta }_2\right|$ are smaller than $\left|{\theta }_1-{\theta }_2\right|/\phantom{\left|{\theta }_1-{\theta }_2\right|2}2$, where ${\theta }_k$ and ${\widehat{\theta }}_k$ ($k=1,2$) are the true and estimated DOAs, respectively. We set ${\theta }_1={20}^{°}$ and ${\theta }_2={\theta }_1+\Delta \theta$, where $\Delta \theta$ is the control variable. We fix $SNR=5$ dB and $T=200$ and plot the resolution probability against $\Delta \theta$ in Figure 5. As can be seen, the resolution ability is enhanced with the increase of $\Delta \theta$. The proposed method provides almost the same resolution performance as ESPRIT-SAL, but with substantially reduced complexity. The proposed method provides the best resolution performance as compared to ESPRIT-SSN and PSS.

To eliminate the ambiguity for some particular angle pairs that satisfy Eqaution (11), we give the ambiguity check results in

Table 3. Ambiguity check results of classical beamforming (CBF) and minimum variance distortionless response (MVDR) with $T=200$ and $SNR=5$ dB.

θ	$-{58.0}^{°}$	${27.8}^{°}$	${48.7}^{°}$	${60.0}^{°}$
$P_{CBF}$|$P_{MVDR}$	0.6122|0.0931	0.5974|0.0926	1.3082|0.9561	1.2529|0.9454
True or false	false|false	false|false	true|true	true|true

. For ${\theta }_1={48.7}^{°}$ and ${60.0}^{°}$ as in Table 1, the estimate of two subarrays may generate another two common angles except for true DOAs; i.e., $-{58.0}^{°}$ and ${27.8}^{°}$. We can see that the true DOAs are checked successfully by both CBF and MVDR. Notice that the spatial output powers for MVDR at true DOAs are much higher than that of other common DOAs, thus the MVDR-based check approach has superior resolution ability. However, since an inverse operation of the covariance matrix is required, the MVDR-based approach has a heavy computation burden. Therefore, the CBF-based approach is more feasible when real-time processing is required.

5. Conclusions

In this paper, we have proposed a low-complexity ESPRIT-based DOA estimation method for co-prime arrays. We firstly map the true DOAs into several equivalent angles for each source, which are regarded as the DOAs impinging on traditional uniform linear array. We obtain the equivalent DOAs by ESPRIT and then recover the candidate DOAs according to their relationship. Finally, we uniquely estimate the true DOAs by finding the common angles of the candidate DOAs of the two subarrays. Simulation results show that the proposed method achieves an improved complexity–performance tradeoff in terms of estimation accuracy and resolution ability, as compared to other existing methods.