# Spatial Information and Performance Evaluation in Coprime Array

Authors: Ying Zhou; Dazhuan Xu; Chao Shi; Weilin Tu
Journal: Mathematical Problems in Engineering
 (2020)

---

## Abstract

In this paper, the mutual information between the received signals and the source in the coprime linear array is investigated. In Shannon’s information theory, the mutual information is used to quantify the reduction in the priori uncertainty of the transmitted message. Similarly, the spatial information in the coprime array is the mutual information between direction of arrival (DOA), source amplitude, and received signals. Such information content is composed of two parts. The first part is DOA information, and the second one is scattering information. In a single source scenario, we derive the theoretical expression and its asymptotic upper bound of DOA information. The corresponding expression of scattering information is also formulated theoretically. Besides, the application of spatial information is discussed. We can obtain the optimal array configuration by maximizing the DOA information of the coprime array. Similarly, the information is also used to quantify the performance difference between the coprime array and uniform array. In addition, the entropy error is employed to evaluate the estimation performance based on spatial information. Numerical simulation of the information content confirms our theoretical analysis. The results in this paper have important guiding significance for the design of the coprime array in the actual environment.


---

## Body

## 1. Introduction

In array signal processing, source estimation is a fundamental application and has been widely used in radar, sonar, acoustics, astronomy, wireless communications, medical imaging, and other areas (see, for example, [1–4]). Hence, direction of arrival (DOA) estimation emerges as an active area of research and the main purpose of which is to determine the location of sources [5]. Many high-resolution DOA estimation algorithms have been proposed, especially the subspace-based methods such as the multiple signal classification (MUSIC) algorithm [6] and estimation of signal parameters via the rotational invariance technique (ESPRIT) algorithm [7]. However, these algorithms are invalid when detecting more sources than the number of sensors. To solve this problem, additional sensors are required to increase the achievable number of degrees-of-freedom (DOFs), which leads to an increased complexity. Therefore, an active research topic has been focused on how to increase the number of DOFs for DOA estimation.Nowadays, coprime arrays, a kind of sparse array, have attracted noticeable attention, owing to their superior performance [8]. Compared with a uniform linear array (ULA), a coprime array has a larger aperture with the same number of sensors so that it can acquire a higher accuracy. More importantly, coprime arrays enable to break through the limitation of the DOFs. Motivated by these advantages, a series of efforts have been made to exploit the coprime array for DOA estimation [9]. Furthermore, in [10], the authors introduced the coprime array into the massive MIMO system to alleviate mutual coupling, increase the DOFs, and enhance the spatial resolution. This approach takes full advantage of the coprime array configuration. In [11], a novel sparse reconstruction-based source estimation algorithm was proposed, which considers the estimation accuracy of DOA and power as well as the number of DOFs. The source estimation algorithm enjoys certain performance advantages over other existing algorithms according to multiple evaluation metrics. There are also some studies on two-dimensional (2D) DOA estimation. The authors in [12] focused on the coprime property of coprime planar arrays (CPPAs), and the sparse array extension model with the sum-difference coarray was derived. Further, they proposed the aperture extension based 2D DOA estimation method with CPPAs via the improved sparse representation algorithm. The cases extending the sparse array extension model for MIMO radars were also discussed in [12].Based on the derived difference coarray, a super-resolution estimation algorithm was proposed in [13] by applying the spatial smoothing technique. The algorithm is able to identify more sources than sensors. However, there may exist several spurious peaks in the estimated spatial spectrum, which will dramatically affect the overall estimation performance. In this sense, it still remains a challenging problem to perform accurate DOA estimation in the coprime array. Recently, some novel high-resolution coprime array DOA estimation algorithms are proposed. In [14], the algorithm is based on the virtual array interpolation and makes full use of the information received by the coprime array, so it has advantages in estimation performance. In [15], a coprime array interpolation approach to provide an off-grid DOA estimation was proposed.The information theory [16] is the theoretical basis of communication technology, and the sensor arrays’ system has a profound internal relationship with the communication system. By observing the received signal of the array, we can obtain information about the source, such as DOA, source amplitude, and so on. From the information theory point of view, mutual information is used to quantify the information about unknown parameters provided by the observation of the output. In light of certain common aspects between the information theory and source estimation problems, it is fairly reasonable to look at these two different areas from a unified perspective. At present, the research based on Shannon information theory for array signal processing mainly focuses on the detection of the number of signals [17]. Many approaches were proposed such as Akaike information criterion (AIC) [18], minimum description length (MDL) criterion [19], and effective detection criterion [20–22]. To the best of our knowledge, only a few researchers employ the information theory to address the performance analysis of the DOA estimation, without studying the amount of information obtained from the multisensor array.In [23], the sensor array information acquisition process was studied for the first time and the initial definition of spatial information is presented therein. However, the author’s research was aimed at the ULA, and there is no application of information theory methods on other array models. So, we apply the framework of spatial information to the coprime array.In this paper, information theory is used to characterize the estimation process in the coprime array system. Here, we just consider the single source case in the system model. Although the derivation of theoretical expressions in this paper is for the case of a single source, it is also applicable to the sparse multiple-source case where the sources do not interfere with each other and each of them can be analysed individually as a single source. It is difficult to analyse a multiple-source case where they are close to each other, even in a ULA system. For adjacent multiple sources, the posterior probability density is multidimensional, so the computation is also very large in numerical simulation. Therefore, in this paper, we only consider the simplest case at present. In the following research, this system model will be gradually extended to a more general multiple-source case. The main contributions of this study are demonstrated as follows.Firstly, the corresponding theoretical expressions of DOA information and scattering information are derived in the existence of complex additive white Gaussian noise when the source is single. The regularity of information change reflects the information acquisition efficiency of a coprime array system and may provide a guidance for system designers. Secondly, the asymptotic upper bound of DOA information is also presented. It is concluded that this upper bound is consistent with CRB at high SNR, determining the maximum accuracy of the estimation. Thirdly, the application of DOA information is discussed. The optimal array configuration can be obtained by maximizing the DOA information of the coprime array. Similarly, we use the asymptotic upper bound of DOA information for the comparison between the coprime array and uniform array. The performance difference between the two models is thus quantified by the difference of the amount of information. For the sake of evaluating information acquisition capability of the coprime array system from the perspective of information theory, we propose an evaluation index entropy error in light of the observation interval and the amount of information. We note that it reflects the dispersion of data set and the accuracy of estimation. It also proves that entropy error tends to CRB in the high SNR region.This paper is organized as follows. The system model of a coprime linear array is presented, and some basic assumptions on priori probability distributions are introduced in Section2. In Section 3, the expression of DOA information and the asymptotic upper bound are derived. The applications of DOA information are discussed in Section 4. The scattering information is studied, and the corresponding theoretical expression is given in Section 5. The proposed concept is tested via a few simulations, which appear in Section 6. The main results of this paper are discussed and concluded in Section 7.


## 2. System Model

Let us consider a general coprime linear array (CLA) made up of two uniform linear arrays, as shown in Figure1. Subarray 1 has M1 sensors spaced M2d apart and subarray 2 has M2 sensors spaced M1d apart. Here, M1 and M2 are the coprime integers (generally assuming M1<M2) and d is a half wavelength, i.e., d=λ/2. Assuming a single far-field narrow-band source is impinging from direction θ, the received signals can be modeled as(1)xt=aθst+wt,where st denotes the signal waveform and wt∼CN0,N0I represents the independent and identically distributed zero-mean additive white Gaussian noise vector. Here, N0 denotes the noise power. aθ represents the steering vector and the specific expression is(2)aθ=1,e−j2π/λq1dsinθ,…,e−j2π/λM−1qM−1dsinθT,where qid denotes the position of the i-th sensor and the total number of elements is M. λ is the carrier wavelength. The directional vector of subarray 1 and subarray 2, respectively, are(3)a1θ=1,e−j2π/λM2dsinθ,…,e−j2π/λM1−1M2dsinθT,(4)a2θ=1,e−j2π/λM1dsinθ,…,e−j2π/λM2−1M1dsinθT.Figure 1
Topological structure of the coprime linear array.According to equations (3) and (4), the total directional vector is(5)aθ=a1Tθ,a21TθT,where a21Tθ is the new direction vector formed by removing the first row of a2Tθ.Considering a single snapshot scenario, omitting timet, we can rewrite (1) as(6)x=aθs+w,where s=αejφ, α is the constant, and φ is uniformly distributed. The received signal is mainly related to the DOA θ and the source s. θ is continuous uniformly distributed in the interval.Next, we introduce a priori probability density function about the direction of angleθ and the phase φ that will be used in the following.θ is uniformly distributed in the interval −Θ/2,Θ/2, where Θ is the observation range. The priori probability of θ is, therefore, given by(7)pθ=1Θ,where φ is uniformly distributed in the interval 0,2π, so the priori probability of φ is given by(8)pφ=12π.Here, we define the source signal-to-noise ratio (SNR) as(9)ρ2=α2N0,where α2 is the power of the useful signal and N0 represents the power of the noise. ρ2 is an important parameter which constantly recurs in the remainder of this paper.According to the above assumption, we will be concerned with the spatial information in the following sections. In [23], the definition of spatial information is given for the first time. The spatial information is expressed as the sum of the DOA information Ix;θ and the scattering information Ix;sθ.


## 3. DOA Information

In this section, we focus on the DOA information, and the actual value of DOA isθ0. We provide the general expression and its asymptotic upper bound. CRB of DOA estimation is also studied further.


### 3.1. General Expression

In order to obtain the DOA information, the central problem is to form the probability distribution of DOA. Our analytical approach is to fix on the typical received signals resulted from the actual value of DOA and to consider the distribution of the estimated value which could have produced it.Consideringw is a complex Gaussian vector, the multidimensional probability density of x conditioned on θ and φ is given by(10)pxθ,φ=1πN0Mexp−1N0x−aθsHx−aθs=1πN0Mexp−1N0xHx+Mα2⋅exp2αN0Ree−jφaHθx,where Re⋅ denotes taking the real part of a complex number. Then the joint probability density of x and θ conditioned on φ is derived as(11)px,θφ=pθpxθ,φ.According to the probability theory, we have the joint probability distribution ofx and θ as(12)px,θ=∫02πpx,θφpφdφ.Then, we have the posteriori probability density function in (13). The term xHx disappears because it depends on the true values instead of the unknown parameters. Note that the denominator is a normalizing constant uncorrelated with the parameters; thus, the shape of the probability distribution is mainly determined by the numerator:(13)pθx=px,θ∫−Θ/2Θ/2px,θdθ=∫02πexp2α/N0Ree−jφaHθxdφ∫−Θ/2Θ/2∫02πexp2α/N0Ree−jφaHθxdφdθ.We further have(14)∫02πexp2αN0Ree−jφaHθxdφ=∫02πexp2αN0ReaHθxcosφ+ImaHθxsinφdφ=2πI02αN0aHθx,where Im⋅ denotes the imaginary part of a complex number and I0⋅ denotes the zero-order modified Bessel function of the first kind. Substituting (14) into (13), we can get the following expression:(15)pθx=I02α/N0aHθx∫−Θ/2Θ/2I02α/N0aHθxdθ.We are concerned about how much information we can obtain from the posteriori probability density function. Since the posteriori probability density ofθ is given, the quantity of DOA information is the difference of the entropies of the priori and posteriori probability distributions based on the mutual information formula, i.e.,(16)Ix;θ=hθ−hθx=log2Θ+Ex∫−Θ/2Θ/2pθxlog2pθxdθ.Although equation (16) is difficult to solve, we can figure out the results through numerical simulation. The asymptotic expression under the specific condition of high SNR is also presented in the following section.


### 3.2. Asymptotic Upper Bound

Considering the actual direction of received signals isθ0 and s=αejφ0, we can rewrite (6) as(17)x=αejφ0aθ0+w.Substituting it into (15) yields another form of the posteriori probability density function conditioned on noise(18)pθw=I02α/N0αaHθaθ0+Fw∫−Θ/2Θ/2I02α/N0αaHθaθ0+Fwdθ.Note thatFw=e−jφ0aHθw is the noise term. Since w is a complex random quantity, the phase e−jφ0 may be absorbed into it without altering its statistical properties and is omitted in the following analysis. It can be seen from equation (18) that the characteristics of pθw depend markedly on the contributions of the signal and noise to the probability distribution.In the case of high SNR, the signal plays a dominant role. We can neglect the noise term without changing the characteristics of the posteriori distribution. Thus, we obtain(19)pθw=I02ρ2aHθaθ0∫−Θ/2Θ/2I02ρ2aHθaθ0dθ.According to the specific expression of the steering vector, we have the expression ofaHθaθ0 in (20), where ω=πdsinθ−sinθ0/λ.(20)aHθaθ0=exp−jωM2M1−1sinωM1M2sinωM2+exp−jωM1M2−1sinωM1M2sinωM1−1=sin2ωM1M2sin2ωM2+sin2ωM1M2sin2ωM1+2sin2ωM1M2sinωM1sinωM2cosωM1−M2+1−2cosωM2M1−1sinωM1M2sinωM2+cosωM1M2−1sinωM1M2sinωM1.In order to extract the approximation of DOA information, we exploit the Taylor series expansion atsinθ=sinθ0 on aHθaθ0 as(21)aHθaθ0≈M−γ2θ−θ02,where the specific expression of γ2 is given by (22) and the higher order term of θ−θ0 is neglected, due to the fact that the DOA is in the vicinity of the true direction θ0 when SNR is high:(22)γ2=M14M22−4M13M22+2M13M23+2M13M2+M12M24−4M12M23+4M12M22−2M12M2+2M1M23−2M1M226Mπ2d2cos2θ0λ2.Moreover, the asymptotic expansion forI0 is(23)I0x∼ex2πx1+18x+o1x2.Substituting (21) and (23) into (19), we can derive(24)pθw≈κexp−2ρ2γ2θ−θ02≈12πσ2exp−θ−θ022σ2,where κ denotes the normalized constant coefficient and the posteriori distribution is approximately Gaussian near θ0. The corresponding variance is given by(25)σ2=4ρ2γ2−1.Based on the derivation of the differential entropy in a Gaussian scenario [24], the asymptotic upper bound of DOA information can be formulated as(26)Ix;θ=hθ−hθx=log2Θ−12log22πeσ2=log2Θ2πeσ2.


### 3.3. Cramér–Rao Bound

In estimation theory, the Cramér–Rao bound (CRB) is a significant evaluating indicator for the performance of unbiased estimators. It provides a lower bound for the mean square error (MSE) of the estimators. In [25], the authors derive the CRB for the unbiased estimator of θ as(27)σCRB2=N02ResHDHθ∏a⊥Dθs−1,where(28)Dθ=∂aθ∂θ,∏a⊥=I−aθaHθaθ−1aHθ.Clearly, in the case of the model in this paper, we have(29)aHθaθ=M,DHθDθ=4π2d2cos2θλ2M22M1M1−12M1−16+M12M2M2−12M2−16,DHθaθ=−jπdcosθλM1M2M1+M2−2.Substituting (29) into (27), we obtain the CRB for DOA estimation in the coprime array as shown in (30). Then according to the specific expression of γ2 in (22), we can simplify the expression of equation (30) as shown in (31). The expression of CRB in (31) is completely the same as (25). It indicates that, as a lower bound of MSE, CRB implies the upper bound of DOA information as well in the high SNR region. Therefore, the posteriori entropy hθx can be used for evaluating the performance of the estimation.(30)σCRB2=23ρ2M14M22−4M13M22+2M13M23+2M13M2+M12M24−4M12M23+4M12M22−2M12M2+2M1M23−2M1M22Mπ2d2cos2θλ2−1,(31)σCRB2=4ρ2γ2−1.


## 3.1. General Expression

In order to obtain the DOA information, the central problem is to form the probability distribution of DOA. Our analytical approach is to fix on the typical received signals resulted from the actual value of DOA and to consider the distribution of the estimated value which could have produced it.Consideringw is a complex Gaussian vector, the multidimensional probability density of x conditioned on θ and φ is given by(10)pxθ,φ=1πN0Mexp−1N0x−aθsHx−aθs=1πN0Mexp−1N0xHx+Mα2⋅exp2αN0Ree−jφaHθx,where Re⋅ denotes taking the real part of a complex number. Then the joint probability density of x and θ conditioned on φ is derived as(11)px,θφ=pθpxθ,φ.According to the probability theory, we have the joint probability distribution ofx and θ as(12)px,θ=∫02πpx,θφpφdφ.Then, we have the posteriori probability density function in (13). The term xHx disappears because it depends on the true values instead of the unknown parameters. Note that the denominator is a normalizing constant uncorrelated with the parameters; thus, the shape of the probability distribution is mainly determined by the numerator:(13)pθx=px,θ∫−Θ/2Θ/2px,θdθ=∫02πexp2α/N0Ree−jφaHθxdφ∫−Θ/2Θ/2∫02πexp2α/N0Ree−jφaHθxdφdθ.We further have(14)∫02πexp2αN0Ree−jφaHθxdφ=∫02πexp2αN0ReaHθxcosφ+ImaHθxsinφdφ=2πI02αN0aHθx,where Im⋅ denotes the imaginary part of a complex number and I0⋅ denotes the zero-order modified Bessel function of the first kind. Substituting (14) into (13), we can get the following expression:(15)pθx=I02α/N0aHθx∫−Θ/2Θ/2I02α/N0aHθxdθ.We are concerned about how much information we can obtain from the posteriori probability density function. Since the posteriori probability density ofθ is given, the quantity of DOA information is the difference of the entropies of the priori and posteriori probability distributions based on the mutual information formula, i.e.,(16)Ix;θ=hθ−hθx=log2Θ+Ex∫−Θ/2Θ/2pθxlog2pθxdθ.Although equation (16) is difficult to solve, we can figure out the results through numerical simulation. The asymptotic expression under the specific condition of high SNR is also presented in the following section.


## 3.2. Asymptotic Upper Bound

Considering the actual direction of received signals isθ0 and s=αejφ0, we can rewrite (6) as(17)x=αejφ0aθ0+w.Substituting it into (15) yields another form of the posteriori probability density function conditioned on noise(18)pθw=I02α/N0αaHθaθ0+Fw∫−Θ/2Θ/2I02α/N0αaHθaθ0+Fwdθ.Note thatFw=e−jφ0aHθw is the noise term. Since w is a complex random quantity, the phase e−jφ0 may be absorbed into it without altering its statistical properties and is omitted in the following analysis. It can be seen from equation (18) that the characteristics of pθw depend markedly on the contributions of the signal and noise to the probability distribution.In the case of high SNR, the signal plays a dominant role. We can neglect the noise term without changing the characteristics of the posteriori distribution. Thus, we obtain(19)pθw=I02ρ2aHθaθ0∫−Θ/2Θ/2I02ρ2aHθaθ0dθ.According to the specific expression of the steering vector, we have the expression ofaHθaθ0 in (20), where ω=πdsinθ−sinθ0/λ.(20)aHθaθ0=exp−jωM2M1−1sinωM1M2sinωM2+exp−jωM1M2−1sinωM1M2sinωM1−1=sin2ωM1M2sin2ωM2+sin2ωM1M2sin2ωM1+2sin2ωM1M2sinωM1sinωM2cosωM1−M2+1−2cosωM2M1−1sinωM1M2sinωM2+cosωM1M2−1sinωM1M2sinωM1.In order to extract the approximation of DOA information, we exploit the Taylor series expansion atsinθ=sinθ0 on aHθaθ0 as(21)aHθaθ0≈M−γ2θ−θ02,where the specific expression of γ2 is given by (22) and the higher order term of θ−θ0 is neglected, due to the fact that the DOA is in the vicinity of the true direction θ0 when SNR is high:(22)γ2=M14M22−4M13M22+2M13M23+2M13M2+M12M24−4M12M23+4M12M22−2M12M2+2M1M23−2M1M226Mπ2d2cos2θ0λ2.Moreover, the asymptotic expansion forI0 is(23)I0x∼ex2πx1+18x+o1x2.Substituting (21) and (23) into (19), we can derive(24)pθw≈κexp−2ρ2γ2θ−θ02≈12πσ2exp−θ−θ022σ2,where κ denotes the normalized constant coefficient and the posteriori distribution is approximately Gaussian near θ0. The corresponding variance is given by(25)σ2=4ρ2γ2−1.Based on the derivation of the differential entropy in a Gaussian scenario [24], the asymptotic upper bound of DOA information can be formulated as(26)Ix;θ=hθ−hθx=log2Θ−12log22πeσ2=log2Θ2πeσ2.


## 3.3. Cramér–Rao Bound

In estimation theory, the Cramér–Rao bound (CRB) is a significant evaluating indicator for the performance of unbiased estimators. It provides a lower bound for the mean square error (MSE) of the estimators. In [25], the authors derive the CRB for the unbiased estimator of θ as(27)σCRB2=N02ResHDHθ∏a⊥Dθs−1,where(28)Dθ=∂aθ∂θ,∏a⊥=I−aθaHθaθ−1aHθ.Clearly, in the case of the model in this paper, we have(29)aHθaθ=M,DHθDθ=4π2d2cos2θλ2M22M1M1−12M1−16+M12M2M2−12M2−16,DHθaθ=−jπdcosθλM1M2M1+M2−2.Substituting (29) into (27), we obtain the CRB for DOA estimation in the coprime array as shown in (30). Then according to the specific expression of γ2 in (22), we can simplify the expression of equation (30) as shown in (31). The expression of CRB in (31) is completely the same as (25). It indicates that, as a lower bound of MSE, CRB implies the upper bound of DOA information as well in the high SNR region. Therefore, the posteriori entropy hθx can be used for evaluating the performance of the estimation.(30)σCRB2=23ρ2M14M22−4M13M22+2M13M23+2M13M2+M12M24−4M12M23+4M12M22−2M12M2+2M1M23−2M1M22Mπ2d2cos2θλ2−1,(31)σCRB2=4ρ2γ2−1.


## 4. The Application of DOA Information

### 4.1. Optimal Array Configuration

Since the mutual information between the received signals and DOA represents the uncertainty reduction of the DOA estimation conditioned on the known received signals, the more DOA information obtained means the higher accuracy of DOA estimation. Thus, we can optimize the array configuration for CLA to maximize the DOA information obtained.Here, we consider the same total number of elementsM. In the expression of the asymptotic upper bound of DOA information, the positions of M1 and M2 are interchangeable. Therefore, equation (26) takes the maximum value when the number of elements of two subarrays is the same. It is clear that on the premise that M1 and M2 are the coprime integers, the closer the two numbers are, the better the performance of the array will be.


### 4.2. Comparison between Coprime Array and Uniform Array

Similarly, we use the asymptotic upper bound of DOA information for comparison between the coprime array and uniform array.In [23], the asymptotic upper bound of DOA information in the ULA in the high SNR region is(32)Iux;θ=log2Θ−12log22πeσu2,where(33)σu2=23ρ2MM2−1π2d2cos2θ0λ2−1.Here, we consider the most extreme case for the array configuration of CLA; that is,M1≈M2≈M+1/2. In this case, the difference between the asymptotic upper bound of DOA information of the two array models is(34)Icx;θ−Iux;θ=12log26γ2λ2MM2−1π2d2cos2θ≈12log24M16−8M15+8M14−4M13M2M2−1≈12log2M216−M4+12.The above equation is the result of quantifying the performance difference between the two array models.


### 4.3. Entropy Error

The previous analysis provides some guidelines for the application of DOA information to the estimation problems. It follows that the posteriori entropyhθx represents the uncertainty of the unknown parameters and can be used for evaluating the performance of the estimation. As SNR increases, the posteriori entropy continues to decline, indicating that the estimation performance is getting better.Therefore, the definition of entropy error (EE) is put forth as an evaluation index to accurately assess the estimation performance in [23]. Although the array model in [23] is a ULA, this evaluation index is also applicable to the CLA in this paper. The specific expression of EE is(35)σEE2=22hθx2πe=12πeΘ222Ix;θ,where Ix;θ is obtained in (16).Note that EE is independent of the specific parameter estimation method. Then, it will provide a basis for comparing the performance of different estimation algorithms.Furthermore, from (26) and (35), we can obtain the lower bound of EE in the case of high SNR(36)σEE2≥4ρ2γ2−1.This equation reflects that EE tends to CRB in the high SNR region.We can learn better about the proposed entropy error from information theory. By Shannon’s theorem for the noisy channel, we are allowed to transmitN=2Iθ;x distinguishable symbols without any error. That is, assuming that the observation interval has been partitioned into N equiprobable subsets, we are able to assign the parameter θ to its proper subset based on observing x, generated by the measurement process.In (35), the entropy error is only related to DOA information and the observation range. When the DOA information increases by 1 bit, the entropy error becomes a quarter of the original value. Similarly, when the observation range is reduced by half, it is the same thing as multiplying the entropy error by a quarter. Therefore, the effect of the increase of 1 bit in DOA information and the reduction of the observation range by half is the same.In conclusion, the greater the mutual information, the smaller the entropy error and the more accurately we can estimate the parameter characterizing the entity we are trying to measure.


## 4.1. Optimal Array Configuration

Since the mutual information between the received signals and DOA represents the uncertainty reduction of the DOA estimation conditioned on the known received signals, the more DOA information obtained means the higher accuracy of DOA estimation. Thus, we can optimize the array configuration for CLA to maximize the DOA information obtained.Here, we consider the same total number of elementsM. In the expression of the asymptotic upper bound of DOA information, the positions of M1 and M2 are interchangeable. Therefore, equation (26) takes the maximum value when the number of elements of two subarrays is the same. It is clear that on the premise that M1 and M2 are the coprime integers, the closer the two numbers are, the better the performance of the array will be.


## 4.2. Comparison between Coprime Array and Uniform Array

Similarly, we use the asymptotic upper bound of DOA information for comparison between the coprime array and uniform array.In [23], the asymptotic upper bound of DOA information in the ULA in the high SNR region is(32)Iux;θ=log2Θ−12log22πeσu2,where(33)σu2=23ρ2MM2−1π2d2cos2θ0λ2−1.Here, we consider the most extreme case for the array configuration of CLA; that is,M1≈M2≈M+1/2. In this case, the difference between the asymptotic upper bound of DOA information of the two array models is(34)Icx;θ−Iux;θ=12log26γ2λ2MM2−1π2d2cos2θ≈12log24M16−8M15+8M14−4M13M2M2−1≈12log2M216−M4+12.The above equation is the result of quantifying the performance difference between the two array models.


## 4.3. Entropy Error

The previous analysis provides some guidelines for the application of DOA information to the estimation problems. It follows that the posteriori entropyhθx represents the uncertainty of the unknown parameters and can be used for evaluating the performance of the estimation. As SNR increases, the posteriori entropy continues to decline, indicating that the estimation performance is getting better.Therefore, the definition of entropy error (EE) is put forth as an evaluation index to accurately assess the estimation performance in [23]. Although the array model in [23] is a ULA, this evaluation index is also applicable to the CLA in this paper. The specific expression of EE is(35)σEE2=22hθx2πe=12πeΘ222Ix;θ,where Ix;θ is obtained in (16).Note that EE is independent of the specific parameter estimation method. Then, it will provide a basis for comparing the performance of different estimation algorithms.Furthermore, from (26) and (35), we can obtain the lower bound of EE in the case of high SNR(36)σEE2≥4ρ2γ2−1.This equation reflects that EE tends to CRB in the high SNR region.We can learn better about the proposed entropy error from information theory. By Shannon’s theorem for the noisy channel, we are allowed to transmitN=2Iθ;x distinguishable symbols without any error. That is, assuming that the observation interval has been partitioned into N equiprobable subsets, we are able to assign the parameter θ to its proper subset based on observing x, generated by the measurement process.In (35), the entropy error is only related to DOA information and the observation range. When the DOA information increases by 1 bit, the entropy error becomes a quarter of the original value. Similarly, when the observation range is reduced by half, it is the same thing as multiplying the entropy error by a quarter. Therefore, the effect of the increase of 1 bit in DOA information and the reduction of the observation range by half is the same.In conclusion, the greater the mutual information, the smaller the entropy error and the more accurately we can estimate the parameter characterizing the entity we are trying to measure.


## 5. Scattering Information

In this section, the scattering information is analysed under the condition that the amplitudeα is constant. In this case, the scattering information is equivalent to the phase information.Similar to the analysis of the DOA information, the central problem is to form a posteriori probability density function of the phase conditioned on the observation vectorx and the parameter θ. Based on the Bayes formula, the posteriori probability density function is presented as(37)pφx,θ=px,φθpxθ=pxθ,φ∫02πpxθ,φdφ.Substituting (10) into (37) and ignoring the constant term, we have(38)pφx,θ=exp2α/N0Ree−jφaHθx∫02πexp2α/N0Ree−jφaHθxdφ.Using the definition of the Bessel functionI0⋅ as specified in (14), we can obtain that(39)pφx,θ=exp2α/N0Ree−jφaHθx2πI02α/N0aHθx.In addition, substituting the actual observation vectorx as in (17) into (39), we have(40)pφw,θ=exp2ρ2Ree−jφaHθaθ0+e−jφFw2πI02ρ2aHθaθ0+Fw.Then, the scattering information is given by(41)Ix;φθ=hφθ−hφx,θ=log22π+Ex,θ∫02πpφx,θlog2pφx,θdφ.From the equation, we can see that the scattering information depends on the value of the DOA when the amplitudeα is constant. This is a general conclusion. It indicates that we have to determine the approximate direction before we estimate the scattering properties.


## 6. Numerical Results

In this section, we provide some simulation results to confirm our theoretical analysis in this paper. In the following simulation, we assume the single source locates in the far field with the true directionθ0=0°. In addition, the constant amplitude α=1 is used.Figure2 depicts the comparison of DOA information between a ULA and a CLA. Here, the number of elements of the uniform array M is set as 10. In the coprime array, M1=5 and M2=6. The parameter setting ensures that the total number of elements in both arrays is the same. In this figure, the curve of DOA information of the coprime array is drawn according to equation (16) and that of uniform array is based on equation (46) in [23]. All of these results are computed in 10000 independent simulation runs. Clearly, the information is approximately zero in the case of low SNR. This is due to the fact that the conditional entropy will not exceed a priori entropy, and the amount of information is non-negative. Thus, its lower bound is definitely zero. It also shows that the power of Gaussian noise is much more significant than that of the useful signal in the low SNR region. It is difficult to locate the source from the noise, and we can obtain little information through the observation. With the increase of SNR, the amount of information increases; thus, the DOA is easy to be estimated accurately. When the SNR is 5 dB, the result of the theoretical expression of DOA information coincides with the upper bound obtained by equation (26). This phenomenon indicates the correctness of our derivation. Furthermore, we can find that the DOA information obtained by the coprime array is 1.469 bit more than that obtained by the uniform array when the SNR is high, which is consistent with the theoretical result of 1.4808 bit obtained by equation (34).Figure 2
DOA information and the asymptotic upper bound for different arrays.Moreover, in order to point out the directive significance of the proposed evaluation index, we compare the theoretical result with the spatially smoothed MUSIC algorithm (SS MUSIC) in [13]. Consistent with the previous simulation parameter, the total number of physical elements is set as 10. Figure 3 shows the comparison among the root mean square error (RMSE) of the actual DOA estimation algorithm, the square root of EE proposed in equation (35), and the square root of CRB. It is illustrated from the figure that EE performs better than RMSE obtained through the algorithm. EE can be computed so long as the posteriori probability distribution is given, thus providing an algorithm independent bound. Besides, in the high SNR region, EE approaches the CRB, verifying the effectiveness of our theoretical analysis in this paper. However, the RMSE of the SS MUSIC algorithm does not achieve the CRB when the SNR is high. This phenomenon is consistent with the simulation results in [26].Figure 3
Comparison among RMSE, EE, and CRB.Figure4 shows the scattering information versus SNR when M1=5 and M2=6. It is noted that the information grows with SNR increasing, which means we can learn better about the source of interest.Figure 4
Scattering information versus SNR.


## 7. Conclusion

In this paper, the spatial information in the CLA is investigated. In a single-source scenario, we derive the theoretical expression of both the DOA information and the scattering information. Furthermore, the asymptotic upper bound of the DOA information is derived, and the numerical results confirm its effectiveness. Moreover, the application of DOA information is also discussed. We obtain the optimal array configuration by maximizing the DOA information of the coprime array. Similarly, we use the asymptotic upper bound of DOA information for the comparison between the coprime array and uniform array. In addition, EE is employed as another performance metric to evaluate the information acquisition capability of the coprime array system. When SNR is high, it approaches to CRB. Finally, we can generalize our research to a more complicated scenario, such as extended source amplitude models and multiple-source estimation especially the case when the number of sources is larger than the number of sensors in the array. All these problems are worthy of further investigations.



---

*Source: 5872329-2020-09-28.xml*