# Partial Dictionary Based Off-Grid DOA Estimation Using Combined Coprime and Nested Array

Authors: Jianfeng Li; Xiong Xu; Ping Li; Qiting Zhang
Journal: Wireless Communications and Mobile Computing
 (2021)

---

## Abstract

A partial dictionary based direction of arrival (DOA) estimation method which addresses the off-grid problem and exploits combined coprime and nested array (CCNA) is proposed. Compared to general coprime array, CCNA yields two sparse coprime subarrays in the coarray domain by adding a third subarray in the physical-array domain. To ensure the DOA estimation performance, the subarray with larger aperture is chosen, and the cyclic phase ambiguity caused by the sparse subarray allows partial dictionary covering arbitrary cycle to represent the whole atoms, and then, the off-grid sparse reconstruction method is developed to amend the grid mismatch. After the sparse recovery and off-grid compensation, ambiguous DOA estimations can be eliminated by substituting the estimations into the whole virtual array. Multiple simulations verify that the proposed algorithm outperforms the other state-of-the-art methods in terms of DOA estimation accuracy and angular resolution.


---

## Body

## 1. Introduction

Direction of arrival (DOA) estimation using antenna array is an important issue in many systems, e.g., radar, sonar, and wireless communication [1–5]. Compared to conventional subspace based methods, sparse representation based DOA estimation methods have been attractive since they can provide higher resolution and require fewer samples [6], and many effective sparse representation based methods have been proposed. The greedy methods [7, 8] require the prior information of source number and are sensitive to the noise, and the l1-norm based algorithms, such as the l1-norm singular value decomposition (l1-SVD) method [9], sparse recovery using weighted subspace fitting (SRWSF) method [10], sparse representation of array covariance vector (SRACV) method [11], and sparse iterative covariance-based estimation (SPICE) method [12], can reduce the sensitivity to noise and estimate the angles via convex optimization. However, these methods discretize the whole spatial range into a grid, which will result in performance degradation when the sources are not exactly located on the grid, i.e., the grid mismatch problem [13]. In [14], the off-grid sources were considered and estimated by introducing grid offsets in the sparse Bayesian inference (SBI). Based on the joint sparsity between original signal and the grid mismatch variables, joint sparse recovery method was proposed in [15]. Meanwhile, the grid-less methods are developed to directly recover the covariance matrix based on atomic norm or nuclear norm minimization [16, 17]. However, these methods only concentrate on the physical array model, which has limited degree of freedom (DOF).Sparse array design has been developed to increase the virtual DOF in the difference coarray domain. Nested array was proposed in [18], which can generate ON2 DOF in the difference coarray domain with only ON physical antennas [19, 20]. Nested array can also be applied in radar system to increase the virtual DOF and enhance the spatial resolution [21]. However, the nested array has a dense subarray, which suffers from the mutual coupling problem. Coprime array [22], another well-known sparse array, was proposed to reduce the mutual coupling influence. With OM+N sparsely spaced physical antennas, coprime array can achieve OMN DOF [23], which is generally nonuniform, and the coarray has more holes compared to that of nested array. Therefore, many works are developed to modify the coprime array to generate more continuous virtual elements in the coarray domain, such as the augmented coprime array (ACA) [24], generalized coprime array (GCA) [25], and thinned coprime array (TCA) [26]. To deal with the one-snapshot situation in the coarray domain, sparse representation based methods have also been introduced for sparse array [27–29]. For off-grid sources, a joint reconstruction method named joint LASSO (JLASSO) was proposed in [30], which can exploit the large DOF in the coarray domain of coprime array and amend the grid mismatch via joint sparse recovery. However, the computation complexity is very high due to the dictionary covering whole spatial range.There is also another way to utilize coprime array, i.e., the separate processing of the two subarrays of coprime array, and the unique estimation is determined from the coincide results from the two subarrays, such as the combined multiple signal classification (MUSIC) method [31], partial search MUSIC method [32], root MUSIC method [33], and combined estimation of signal parameters via rotational invariance technique (ESPRIT) based method [34]. However, as the subarrays are processed separately in the physical-array domain, the exploited DOF is limited, and an alternative way is to transform the coprime relationship into the coarray domain [35]. A combined coprime and nested array (CCNA) geometry, which is obtained by adding a third subarray nested to both of the two subarrays, was proposed in [36], where the coprime subarrays are transformed into the coarray domain to achieve large aperture and DOF. However, the utilized MUSIC method results in aperture loss.In this paper, we propose an off-grid DOA estimation method, which requires only partial dictionary based on CCNA. Due to the nested relationship within the subarrays, the two virtual subarrays are still sparse but uniform after the vectorization of the covariance matrices. Different with conventional schemes, we adopt the subarray with larger aperture for DOA estimation to avoid the negative effective brought by the smaller subarray. The sparsity of the virtual array enables partial dictionary covering partial spatial range to represent the whole-range atoms. Meanwhile, the off-grid sparse reconstruction method is developed to amend the grid mismatch. Finally, ambiguous DOA estimations can be eliminated based on coprime-ness by substituting the estimations into the whole virtual array. Numerical simulations show that the proposed algorithm outperforms the ACA method [24], partial search (PS) MUSIC [32], root MUSIC method [33], and CCNA with root MUSIC [36] in terms of estimation accuracy and angular resolution.Notation: .T, .∗, .H, and .+ denote transposition, conjugation, conjugate-transposition, and pseudo-inversion, respectively. E. and vec. denote the operations of expectation and vectorization, respectively. diaga is a diagonal matrix with vector a being the diagonal elements, and Ip is a p×p identity matrix. ⋅2 means l2 norm, and anglea means the phase of a. ⊗, ∘, and ./ denote kronecker product, Khatri_rao product, and element-wise division, respectively.


## 2. Data Model

Figure1 shows the structure of CCNA, which is composed of three subarrays. Subarray 1 and subarray 2 form the original coprime array, where M and N are coprime integers. The third subarray is arranged along the negative side with L elements and interelement spacing being MNd, where d is the unit spacing, which is generally set as half-wavelength. It is also indicated that subarray 1 and subarray 3 form a nested array with the minimum interelement spacing being Nd, and subarray 1 and subarray 3 form another nested array with the minimum interelement spacing being Md. The total antenna number of CCNA is M+N+L−2 as the subarrays share the same element in the origin.Figure 1
The structure of CCNA.Assume that there areK plane waves impinging upon the array with DOAs being θk,k=1,⋯,K, which is angle between the wave line and Z axis. Then, the outputs of the subarrays are expressed as
(1)x1t=A1st+n1t,x2t=A2st+n2t,x3t=A3st+n3t,where st=s1t,⋯,sKtT∈CK×1 is the signal vector. n1t, n2t, and n3t are the additive white Gaussian noise (AWGN) vectors with the same noise power σ2. A1=a1θ1,⋯,a1θK, A2=a2θ1,⋯,a2θK, and A3=a3θ1,⋯,a3θK denote the direction matrices of subarray 1, subarray 2, and subarray 3, respectively. The columns are the corresponding steering vectors, which are expressed as
(2)a1θk=1,e−jNπsinθk,⋯,e−jM−1NπsinθkT,k=1,⋯,K,a2θk=1,e−jMπsinθk,⋯,e−jN−1MπsinθkT,k=1,⋯,K,a3θk=1,ejMNπsinθk,⋯,ejL−1MNπsinθkT,k=1,⋯,K.


## 3. Partial Dictionary Based Off-Grid DOA Estimation Method

### 3.1. Sparse Representation Using Partial Dictionary

Combine the outputs of subarray 1 and subarray 3 to form the first nested arrayy1t=x1Tt,x3TtT, whose covariance matrix is
(3)R1=Ey1ty1Ht=An1RsAn1H+σ2IM+L−1,where An1t=A1Tt,A3TtT is the combined direction matrix and Rs=EstsHt=diagσ12,⋯,σK2 is a diagonal matrix containing signal powers. To obtain the virtual array in the coarray domain, the vectorization of the covariance matrix is
(4)r1=vecR1=An1∗∘An1p+σ2vecIM+L−1,where p=σ12,⋯,σK2T. Due to the nested relationship, there are 2LM−1 continuous elements located from −LM−1Nd to LM−1Nd in the virtual array with interelement spacing being Nd [36]. After selecting continuous elements from r1, then, we obtain
(5)rs1=Ws1r1=As1p+σ2e1,where Ws1 is the selecting matrix and e1 denotes the column vector after the same selecting operation from vecIM+L−1. As1=as1θ1,as1θ2,⋯,as1θK is the direction matrix of the continuous part, where
(6)as1θk=e−jLM−1Nπsinθk,⋯,e−jNπsinθk,1,ejNπsinθk,⋯,ejLM−1NπsinθkT,k=1,⋯,K.Similar with the steps from Eq. (3) to Eq. (5), we can obtain another virtual array from the overall output of subarray 2 and subarray 3, which can be expressed as
(7)rs2=As2p+σ2e2,where e2 denotes a column vector after the selecting operation andAs2=as2θ1,as2θ2,⋯,as2θK is the direction matrix corresponding to an 2LN−1-element array located from −LN−1Md to LN−1Md with interelement spacing being Md. The steering vector is
(8)as2θk=e−jLN−1Mπsinθk,⋯,e−jMπsinθk,1,ejMπsinθk,⋯,ejLN−1MπsinθkT,k=1,⋯,K.Now, the two virtual coprime subarrays in Eq. (5) and Eq. (7) are obtained, and the large interelement spacing will result in parameter estimation ambiguity problem. However, our method will in turn exploit the phase ambiguity to reduce the complexity and then eliminate the ambiguity based on the coprime-ness between Mand N. Suppose M>N, then the first subarray in Eq. (5) achieves larger aperture than that in Eq. (7), so we choose rs1 to estimate the DOA for better estimation performance.As the virtual output has only one snapshot, sparse representation framework will be established to avoid the aperture loss caused by the spatial smoothing [24]. Discretize the whole spatial range as a grid θ~1,θ~2,⋯,θ~PP≫K, and suppose that all the true DOAs fall in the grid, i.e., the dictionary Ω=as1θ~1,⋯,as1θ~P,e1 contains the columns of As1, then Eq. (5) can be rewritten in a sparse form as
(9)rs1=Ωρ,where ρ∈ℂP+1×1 is a sparse vector, whose elements corresponding to the true DOAs keep the same with those in p and last element is noise power σ2. After sparse recovery, the positions of nonzero elements (except the last element) in ρ will give the estimations of the DOAs. However, as the interelement spacing of the virtual array is Nd, which is larger than half-wavelength, then there are phase ambiguities in Ω. To clearly elaborate this problem, let zp=e−jNπsinθ~p; then, zp determines the uniqueness of as1θ~p due to the Vandermonde structure, i.e., if zp=zq, then as1θ~p=as1θ~q.AsN>1, there is a cyclic phase ambiguity in zp. Except for θ~p, there are other N−1 angles θ~p,n,n=2,⋯,N satisfying
(10)e−jNπsinθ~p,n=zp,n=2,⋯,N.It can be derived from Eq. (10) that the relationship between θ~p and θ~p,n,n=2,⋯,N is
(11)sinθ~p,n=sinθ~p−2mN,n=2,⋯,N,where m is an integer making sinθ~p,n locate at the range [-1, 1]. If angles θ~p,n,n=2,⋯,N are also located in the grid θ~1,θ~2,⋯,θ~P, then θ~p and θ~p,n,n=2,⋯N will provide N identical columns in the dictionary matrix Ω due to Eq. (10). This will not only cause the estimation ambiguity but may also make the sparse recovery fail. However, we can in turn exploit the ambiguity to reduce the size of the dictionary and then reduce the complexity of sparse recovery accordingly.From Eq. (11), it is shown that the N solutions sinθ~p and sinθ~p,n,n=2,⋯,N are uniformly distributed among the range [-1, 1] following a circle 2/N. An example is shown in Figure 2, where sinθ~p=0.5 and N=3, then other two solutions are sinθ~p,2=−1/6 and sinθ~p,3=−5/6, respectively. It is also shown by the dashed lines in Figure 2 that if we divide the whole range into N cycles with width being 2/N, then there is only one solution in one cycle based on Eq. (11). As these solutions provide identical atoms in the dictionary, we can choose one cycle as a representative to construct the dictionary. Without loss of generality, we choose range −1/N,1/N, and the angle range is arcsin−1/N,arcsin1/N, whose corresponding dictionary is denoted by Ωsub; then, the sparse form in Eq. (9) becomes
(12)rs1=Ωsubρ,where ρ∈ℂP+1×1 is a K-sparse vector, whose elements corresponding to the true steering vectors (maybe not the true DOAs) keep the same with those in p, and the others are zero (except the last element). For example, as shown in Figure 2, the true solution is 0.5, and the representative solution in the partial dictionary Ωsub is -1/6.Figure 2
The relationship between the real and ambiguous solutions.Due to Eq. (12), the phase ambiguity in the dictionary can be avoided now. Meanwhile, as now the size of the dictionary Ωsub is only 1/N of its original size, the computation complexity of sparse recovery can be reduced.


### 3.2. Off-Grid Sparse Representation Framework

Now a partial dictionary based sparse representation framework is established, but it is built based on the assumption that the true DOAs or their representative angles are located in the grid. However, the angles are very likely to lie off the discretized grid, no matter how fine the grid is defined. Off-grid sources will bring in grid mismatch problem and degrade the sparse recovery performance significantly. In this section, we take the off-grid problem into account and reformulate the sparse representation to enhance the robustness to grid mismatch.Within the rangearcsin−1/N,arcsin1/N, we denote the uniformly sampled grid as θ~1,θ~2,⋯,θ~Q with adjacent interval being g. Then, the true DOA or its representative angle θ¯k can be represented by a nearest grid θ~q,k plus an offset αk, which is among the range −g/2,g/2. Based on first order Taylor expansion around the grid [14], the true steering vector can be approximately expressed as
(13)as1θ¯k≈as1θ~q,k+∂as1θ~q,k∂θ~q,kαk,where αk=θ¯k−θ~q,k. Then, Eq. (12) is revised as
(14)rs1=Ωsub+Ωsub′Λρ,where Ωsub′=∂as1θ~1/∂θ~1,⋯,∂as1θ~Q/∂θ~Q,e1, Λ=diagβ, and
(15)βq=αk,ifθ~q,k=θ~q,k=1,⋯,K0,others,q=1,⋯,Q.Let ω=Λρ, then it is easy to verify that ω and ρ are joint sparse [30]. So the off-grid sparse formulation can be expressed as
(16)minh2,1s.t.rs1=Ωsubρ+Ωsub′ω−g2ρ≤ω≤g2ρ,where h=ρT,ωTT, and h2,1=∑i=1Qρi2+ωi2, where ρi means the i-th element of ρ. It should be noted that the covariance matrix in Eq. (3) can only be estimated via finite snapshots
(17)R^1=1T∑t=1Ty1ty1Ht,where T denotes the snapshot number. So the sparse form in Eq. (16) is not robust due to the residual error. Use Δr1 to denote the deviation of r1 in Eq. (6), then according to [37], Δr1 follows asymptotic normal distribution with zero mean and covariance matrix being 1/TR1T⊗R1(18)Δr1∼AsN0,1TR1T⊗R1.After selecting operation(19)Δrs1∼AsN0,1TWs1R1T⊗R1Ws1H.Define weight matrixW=1/TWs1R1T⊗R1Ws1H, then
(20)W−1/2Δrs1∼AsN0,I2LM−1.From Eq. (20), W−1/2Δrs122 follows an asymptotic chi-square distribution with 2LM−1 DOF. Consequently, the enhanced sparse recovery problem can be formulated as
(21)min.h2,1s.t.W∧−1/2rs1−Ωsubρ−Ωsub′ω2≤ξ−g2ρ≤ω≤g2ρ,where W^=1/TWs1R^1T⊗R^1Ws1H is the approximate weight matrix;ξ is the up bound of the fitting error, which can be set as ξ=chi2inv1−p,2LM−1 [11], where chi2inv1−p,2LM−1 denotes the inverse cumulative distribution function that makes the inequality holds with a probability 1−p. Generally, it is enough to set p=0.001 to make it nearly a sure event.After solving Eq. (21) via CVX [38, 39], we can obtain the estimations of ρ and ω, which are denoted as ρ^ and ω^, respectively.


### 3.3. Ambiguity Elimination

The positions of nonzero elements in the firstQ elements of ρ^ and ω^ give the initial DOA estimations θ~q,k,k=1,⋯,K, which are the grids nearest to the true DOAs or their representative angles. Besides, the offset vector can be obtained via
(22)β=diagρ^./ω^,where ./ means element-wise division. Then, the angles are obtained via
(23)θ¯k=θ~q,k+αk,k=1,⋯,K,where the offsets αk,k=1,⋯,K are obtained from the first Q elements of β in Eq. (22).Now, the angles are estimated with offsets being compensated, but the angles in Eq. (23) may be true DOAs and also may be representative angles. As been discussed in Eq. (10) and Eq. (11), there are totally N angles including θ¯k sharing the same atom, and their relationship is
(24)sinθ¯k,n=sinθ¯k−2mN,n=2,⋯,N,where m is an integer making sinθ¯k,n locate at the range [-1, 1].To determine the unique DOA without ambiguity, we substitute theN angles in Eq. (24) into the whole virtual array
(25)maxanHr,where r=rs1T,rs2TT and an=as1Tθ¯k,n,as2Tθ¯k,nT. Due to the coprime relationship between the two subarrays, the unique DOA can be determined from the coincide results from the two subarrays. Consequently, if the whole array containing both two subarrays is exploited, unique angle is determined by finding the maximum value in Eq. (25).For the complexity, the proposed method only requires partial dictionary, and the main complexity lies in the construction of two covariance matrices and sparse recovery. The total number of complex multiplications is aboutM+L−12+N+L−12T+2LM−1n3+N2LM+2LN−2, where n denotes the dictionary size. The proposed method has lower complexity than peak search method [24] and other sparse representation methods that require whole dictionary [27–30]. Compared to DOA estimation methods with closed-form solution, e.g., ESPRIT and root-MUSIC, the proposed method costs more but achieves better estimation performance, which will be verified in the simulation section below.


## 3.1. Sparse Representation Using Partial Dictionary

Combine the outputs of subarray 1 and subarray 3 to form the first nested arrayy1t=x1Tt,x3TtT, whose covariance matrix is
(3)R1=Ey1ty1Ht=An1RsAn1H+σ2IM+L−1,where An1t=A1Tt,A3TtT is the combined direction matrix and Rs=EstsHt=diagσ12,⋯,σK2 is a diagonal matrix containing signal powers. To obtain the virtual array in the coarray domain, the vectorization of the covariance matrix is
(4)r1=vecR1=An1∗∘An1p+σ2vecIM+L−1,where p=σ12,⋯,σK2T. Due to the nested relationship, there are 2LM−1 continuous elements located from −LM−1Nd to LM−1Nd in the virtual array with interelement spacing being Nd [36]. After selecting continuous elements from r1, then, we obtain
(5)rs1=Ws1r1=As1p+σ2e1,where Ws1 is the selecting matrix and e1 denotes the column vector after the same selecting operation from vecIM+L−1. As1=as1θ1,as1θ2,⋯,as1θK is the direction matrix of the continuous part, where
(6)as1θk=e−jLM−1Nπsinθk,⋯,e−jNπsinθk,1,ejNπsinθk,⋯,ejLM−1NπsinθkT,k=1,⋯,K.Similar with the steps from Eq. (3) to Eq. (5), we can obtain another virtual array from the overall output of subarray 2 and subarray 3, which can be expressed as
(7)rs2=As2p+σ2e2,where e2 denotes a column vector after the selecting operation andAs2=as2θ1,as2θ2,⋯,as2θK is the direction matrix corresponding to an 2LN−1-element array located from −LN−1Md to LN−1Md with interelement spacing being Md. The steering vector is
(8)as2θk=e−jLN−1Mπsinθk,⋯,e−jMπsinθk,1,ejMπsinθk,⋯,ejLN−1MπsinθkT,k=1,⋯,K.Now, the two virtual coprime subarrays in Eq. (5) and Eq. (7) are obtained, and the large interelement spacing will result in parameter estimation ambiguity problem. However, our method will in turn exploit the phase ambiguity to reduce the complexity and then eliminate the ambiguity based on the coprime-ness between Mand N. Suppose M>N, then the first subarray in Eq. (5) achieves larger aperture than that in Eq. (7), so we choose rs1 to estimate the DOA for better estimation performance.As the virtual output has only one snapshot, sparse representation framework will be established to avoid the aperture loss caused by the spatial smoothing [24]. Discretize the whole spatial range as a grid θ~1,θ~2,⋯,θ~PP≫K, and suppose that all the true DOAs fall in the grid, i.e., the dictionary Ω=as1θ~1,⋯,as1θ~P,e1 contains the columns of As1, then Eq. (5) can be rewritten in a sparse form as
(9)rs1=Ωρ,where ρ∈ℂP+1×1 is a sparse vector, whose elements corresponding to the true DOAs keep the same with those in p and last element is noise power σ2. After sparse recovery, the positions of nonzero elements (except the last element) in ρ will give the estimations of the DOAs. However, as the interelement spacing of the virtual array is Nd, which is larger than half-wavelength, then there are phase ambiguities in Ω. To clearly elaborate this problem, let zp=e−jNπsinθ~p; then, zp determines the uniqueness of as1θ~p due to the Vandermonde structure, i.e., if zp=zq, then as1θ~p=as1θ~q.AsN>1, there is a cyclic phase ambiguity in zp. Except for θ~p, there are other N−1 angles θ~p,n,n=2,⋯,N satisfying
(10)e−jNπsinθ~p,n=zp,n=2,⋯,N.It can be derived from Eq. (10) that the relationship between θ~p and θ~p,n,n=2,⋯,N is
(11)sinθ~p,n=sinθ~p−2mN,n=2,⋯,N,where m is an integer making sinθ~p,n locate at the range [-1, 1]. If angles θ~p,n,n=2,⋯,N are also located in the grid θ~1,θ~2,⋯,θ~P, then θ~p and θ~p,n,n=2,⋯N will provide N identical columns in the dictionary matrix Ω due to Eq. (10). This will not only cause the estimation ambiguity but may also make the sparse recovery fail. However, we can in turn exploit the ambiguity to reduce the size of the dictionary and then reduce the complexity of sparse recovery accordingly.From Eq. (11), it is shown that the N solutions sinθ~p and sinθ~p,n,n=2,⋯,N are uniformly distributed among the range [-1, 1] following a circle 2/N. An example is shown in Figure 2, where sinθ~p=0.5 and N=3, then other two solutions are sinθ~p,2=−1/6 and sinθ~p,3=−5/6, respectively. It is also shown by the dashed lines in Figure 2 that if we divide the whole range into N cycles with width being 2/N, then there is only one solution in one cycle based on Eq. (11). As these solutions provide identical atoms in the dictionary, we can choose one cycle as a representative to construct the dictionary. Without loss of generality, we choose range −1/N,1/N, and the angle range is arcsin−1/N,arcsin1/N, whose corresponding dictionary is denoted by Ωsub; then, the sparse form in Eq. (9) becomes
(12)rs1=Ωsubρ,where ρ∈ℂP+1×1 is a K-sparse vector, whose elements corresponding to the true steering vectors (maybe not the true DOAs) keep the same with those in p, and the others are zero (except the last element). For example, as shown in Figure 2, the true solution is 0.5, and the representative solution in the partial dictionary Ωsub is -1/6.Figure 2
The relationship between the real and ambiguous solutions.Due to Eq. (12), the phase ambiguity in the dictionary can be avoided now. Meanwhile, as now the size of the dictionary Ωsub is only 1/N of its original size, the computation complexity of sparse recovery can be reduced.


## 3.2. Off-Grid Sparse Representation Framework

Now a partial dictionary based sparse representation framework is established, but it is built based on the assumption that the true DOAs or their representative angles are located in the grid. However, the angles are very likely to lie off the discretized grid, no matter how fine the grid is defined. Off-grid sources will bring in grid mismatch problem and degrade the sparse recovery performance significantly. In this section, we take the off-grid problem into account and reformulate the sparse representation to enhance the robustness to grid mismatch.Within the rangearcsin−1/N,arcsin1/N, we denote the uniformly sampled grid as θ~1,θ~2,⋯,θ~Q with adjacent interval being g. Then, the true DOA or its representative angle θ¯k can be represented by a nearest grid θ~q,k plus an offset αk, which is among the range −g/2,g/2. Based on first order Taylor expansion around the grid [14], the true steering vector can be approximately expressed as
(13)as1θ¯k≈as1θ~q,k+∂as1θ~q,k∂θ~q,kαk,where αk=θ¯k−θ~q,k. Then, Eq. (12) is revised as
(14)rs1=Ωsub+Ωsub′Λρ,where Ωsub′=∂as1θ~1/∂θ~1,⋯,∂as1θ~Q/∂θ~Q,e1, Λ=diagβ, and
(15)βq=αk,ifθ~q,k=θ~q,k=1,⋯,K0,others,q=1,⋯,Q.Let ω=Λρ, then it is easy to verify that ω and ρ are joint sparse [30]. So the off-grid sparse formulation can be expressed as
(16)minh2,1s.t.rs1=Ωsubρ+Ωsub′ω−g2ρ≤ω≤g2ρ,where h=ρT,ωTT, and h2,1=∑i=1Qρi2+ωi2, where ρi means the i-th element of ρ. It should be noted that the covariance matrix in Eq. (3) can only be estimated via finite snapshots
(17)R^1=1T∑t=1Ty1ty1Ht,where T denotes the snapshot number. So the sparse form in Eq. (16) is not robust due to the residual error. Use Δr1 to denote the deviation of r1 in Eq. (6), then according to [37], Δr1 follows asymptotic normal distribution with zero mean and covariance matrix being 1/TR1T⊗R1(18)Δr1∼AsN0,1TR1T⊗R1.After selecting operation(19)Δrs1∼AsN0,1TWs1R1T⊗R1Ws1H.Define weight matrixW=1/TWs1R1T⊗R1Ws1H, then
(20)W−1/2Δrs1∼AsN0,I2LM−1.From Eq. (20), W−1/2Δrs122 follows an asymptotic chi-square distribution with 2LM−1 DOF. Consequently, the enhanced sparse recovery problem can be formulated as
(21)min.h2,1s.t.W∧−1/2rs1−Ωsubρ−Ωsub′ω2≤ξ−g2ρ≤ω≤g2ρ,where W^=1/TWs1R^1T⊗R^1Ws1H is the approximate weight matrix;ξ is the up bound of the fitting error, which can be set as ξ=chi2inv1−p,2LM−1 [11], where chi2inv1−p,2LM−1 denotes the inverse cumulative distribution function that makes the inequality holds with a probability 1−p. Generally, it is enough to set p=0.001 to make it nearly a sure event.After solving Eq. (21) via CVX [38, 39], we can obtain the estimations of ρ and ω, which are denoted as ρ^ and ω^, respectively.


## 3.3. Ambiguity Elimination

The positions of nonzero elements in the firstQ elements of ρ^ and ω^ give the initial DOA estimations θ~q,k,k=1,⋯,K, which are the grids nearest to the true DOAs or their representative angles. Besides, the offset vector can be obtained via
(22)β=diagρ^./ω^,where ./ means element-wise division. Then, the angles are obtained via
(23)θ¯k=θ~q,k+αk,k=1,⋯,K,where the offsets αk,k=1,⋯,K are obtained from the first Q elements of β in Eq. (22).Now, the angles are estimated with offsets being compensated, but the angles in Eq. (23) may be true DOAs and also may be representative angles. As been discussed in Eq. (10) and Eq. (11), there are totally N angles including θ¯k sharing the same atom, and their relationship is
(24)sinθ¯k,n=sinθ¯k−2mN,n=2,⋯,N,where m is an integer making sinθ¯k,n locate at the range [-1, 1].To determine the unique DOA without ambiguity, we substitute theN angles in Eq. (24) into the whole virtual array
(25)maxanHr,where r=rs1T,rs2TT and an=as1Tθ¯k,n,as2Tθ¯k,nT. Due to the coprime relationship between the two subarrays, the unique DOA can be determined from the coincide results from the two subarrays. Consequently, if the whole array containing both two subarrays is exploited, unique angle is determined by finding the maximum value in Eq. (25).For the complexity, the proposed method only requires partial dictionary, and the main complexity lies in the construction of two covariance matrices and sparse recovery. The total number of complex multiplications is aboutM+L−12+N+L−12T+2LM−1n3+N2LM+2LN−2, where n denotes the dictionary size. The proposed method has lower complexity than peak search method [24] and other sparse representation methods that require whole dictionary [27–30]. Compared to DOA estimation methods with closed-form solution, e.g., ESPRIT and root-MUSIC, the proposed method costs more but achieves better estimation performance, which will be verified in the simulation section below.


## 4. Simulation Results

In the simulations, the CCNA is configured withM=4, N=3, and L=3. T=500 snapshots are collected to estimate the covariance matrix, and the root mean square error (RMSE) is defined below to measure the DOA estimation performance
(26)RMSE=1K∑k=1K1D∑i=1Dθ∧k,i−θk2,where θ^k,i denotes the estimations of θk of the i-th Monte Carlo trial and D=200 trials are carried out.With the measurement of RMSE, Figures3 and 4 present the angle estimation accuracy comparisons between the proposed algorithm and other methods versus SNR and snapshot number, respectively. The ACA method [24], PS-MUSIC using prototype coprime array [32], root-MUSIC method using prototype coprime array [33], and root-MUSIC using CCNA [36] all adopt the same number of physical antennas with the proposed method for fair comparison. It is indicated from Figures 3 and 4 that the proposed algorithm outperforms the other methods, and the main reasons include (1) the virtual subarray with larger aperture is chosen to avoid the negative effect from the smaller subarray, and (2) the off-grid sparse representation is established to amend the grid mismatch problem. The PS-MUSIC has the worst performance, especially with low SNR, as it has the additional pairing problem, and it utilizes the data from the physical array, which has limited DOF.Figure 3
Angle estimation accuracy comparison versus SNR.Figure 4
Angle estimation accuracy comparison versus snapshot number (SNR=10 dB).To test the resolution performance of the algorithms, we choose two closely spaced sources with angles beingθ1=10∘ and θ2=12∘, respectively. Figure 5 shows the estimation results of the algorithms over 20 trials with SNR=0 dB. It is indicated that the proposed method can always clearly identify the two sources, while the other methods have big deviations. Consequently, the proposed method achieves the best angular resolution.Figure 5
Angle estimation results of closely spaced sources (SNR=0 dB).


## 5. Conclusions

An off-grid DOA estimation method exploiting CCNA is proposed. Based on the nested relationships within the three subarrays, two virtual coprime subarrays are obtained firstly in the coarray domain. Thereafter, subarray with larger aperture is chosen for enhanced estimation performance, and cyclic phase ambiguity is exploited to reduce the size of the dictionary. Meanwhile, off-grid sparse reconstruction method is established to amend the grid mismatch. Finally, DOA is uniquely determined by substituting the ambiguous into the whole array. Compared to other methods with simulations, the proposed approach is verified that it has better DOA estimation performance and angular resolution.



---

*Source: 9939651-2021-05-27.xml*