ESPRIT-Like Two-Dimensional DOA Estimation for Monostatic MIMO Radar with Electromagnetic Vector Received Sensors under the Condition of Gain and Phase Uncertainties and Mutual Coupling

In this paper, we focus on the problem of two-dimensional direction of arrival (2D-DOA) estimation for monostatic MIMO Radar with electromagnetic vector received sensors (MIMO-EMVSs) under the condition of gain and phase uncertainties (GPU) and mutual coupling (MC). GPU would spoil the invariance property of the EMVSs in MIMO-EMVSs, thus the effective ESPRIT algorithm unable to be used directly. Then we put forward a C-SPD ESPRIT-like algorithm. It estimates the 2D-DOA and polarization station angle (PSA) based on the instrumental sensors method (ISM). The C-SPD ESPRIT-like algorithm can obtain good angle estimation accuracy without knowing the GPU. Furthermore, it can be applied to arbitrary array configuration and has low complexity for avoiding the angle searching procedure. When MC and GPU exist together between the elements of EMVSs, in order to make our algorithm feasible, we derive a class of separated electromagnetic vector receiver and give the S-SPD ESPRIT-like algorithm. It can solve the problem of GPU and MC efficiently. And the array configuration can be arbitrary. The effectiveness of our proposed algorithms is verified by the simulation result.


Introduction
Since its first appearance more than a decade ago, Multiple-Input Multiple-Output (MIMO) radar has become a research hotspot [1][2][3]. It makes use of multiple antennas to emit orthogonal waveforms and utilizes multiple antennas to receive the echoes which will bring unique advantages [4]. It also can emit correlated waveforms to achieve more flexible beam pattern designs [5]. There are many methods for beampattern design, such as the classic Capon beamforming method and its improved form [6][7][8]. For MIMO radar, we can realize the beampattern design through flexible waveform design [9]. For example, Ahmed et al. [10] propose a transmit beampattern design method based on one step unconstrained optimization, which avoids the design of waveform covariance matrix and reduces the complexity. The robust waveform covariance matrix design with minimum sidelobe level or minimum integrated sidelobe level is studied in [11] and it also gives a design method which has polynomial time complexity. There are two categories of MIMO radar. One is statistical MIMO radar whose array spacing is very large. It can achieve diversity gains and overcome the effect of target scintillation [12,13]. The other is colocated MIMO whose array elements are closely spaced [14][15][16]. This can improve the parameter estimation performance significantly. Angle estimation is very important in radar system [17], so in this paper, we pay attention to the 2D-DOA estimation of collocated monostatic MIMO radars.
There are many algorithms for direction of arrival (DOA) estimation, such as the Capon method [18], multiple signal classification (MUSIC) algorithm [19], and the estimation of signal parameter via rotational invariance technique (ESPRIT) algorithm [20]. In addition, the sparse signal reconstruction-based DOA estimation algorithm has become a hot research topic [21]. These algorithms can achieve high estimation accuracy and have been successfully applied to the DOA and direction of departure (DOD) estimation in MIMO radar [22][23][24]. Among them, the ESPRIT algorithm has received extensive attention because of its high computational efficiency.
Polarization sensitive array signal processing is a new bench of array signal processing [25] that has received a lot of attention recently [26,27]. A polarization array is an array consisting of multiple polarization-sensitive units which are spatially distributed in a certain structure and are not identical in polarization [28]. Unlike conventional scalar sensor arrays, polarization-sensitive arrays can acquire polarization direction information, that is, they have polarization diversity capability. This outstanding feature provides a new and useful means for information acquisition and transmission [29].
The combination of a MIMO array and a polarization-sensitive array will bring much more performance improvement in parameter estimation [30]. Based on this, Jiang et al. [31] proposed polarimetric MIMO radar. Its transmitting array consists of scalar antennas and its receiving array is composed of cross-dipole vector antennas. Then it utilizes ESPRIT algorithm to estimate DOD, DOA and polarization station angle (PSA). Gu et al. [30] used a six-component electromagnetic vector sensor (EMVS) to increase the information of a single vector antenna. As we all know, the spatial electromagnetic wave signal is a vector signal. The complete electric and magnetic information of a vector signal is a complex vector with six dimensions. Most of the existing radar systems use a single polarization scalar array to obtain only one-dimensional electromagnetic wave signal information. The electromagnetic vector sensor can get all or at least more than one dimension information of space electromagnetic wave signals. For example, Jiang et al. [31] adopted cross-dipole antennas. Therefore, the vector antennas only obtain two-component electric-field of source. Gu et al. [30] adopted a six-component electromagnetic vector-sensor which uses three orthogonal electric-dipoles and magnetic-loops to measure the three electric-field-and three magnetic-field parameters of the incident signals, respectively. Thus the EMVS can get complete electromagnetic vector information. The EMVS is a new type of single input multiple output antenna which receiving close attention from academia and industry. Because it uses more information, we can get more advantages in DOA estimation. For example, we can use the relationship between these electromagnetic components to estimate DOA. Besides, we can combine it with the ESPRIT results to improve the estimation accuracy of DOA. Then, Zheng et al. [26] extended EMVS to the MIMO radar. It uses the rotational invariance of the spatial-polarimetric domain (SPD) and proposes a corresponding ESPRIT-like method to estimate the 2D-DOA and PSA in monostatic MIMO radar. It is suitable for arbitrary array configurations.
However, all the above methods are based on the hypothesis that there are no gain and phase uncertainties (GPU) and the mutual coupling (MC) of EMVS components is also not considered. There are too many uncertainties in the actual production of the antenna, the amplitude and the phase gain of different array elements cannot be exactly the same, so amplitude and phase errors and mutual coupling are very common in practical situations. When the element spacing is relatively close, the mutual coupling between the elements is unavoidable, so in practice, the array manifold is inevitably affected by mutual coupling and array gain or phase uncertainties. This results in significant distortion of the amplitude and phase of the signals received from the array, so the direct use of these methods will lead to a serious degradation of estimation accuracy or even failure. How to eliminate this effect is a meaningful task. There are many people researching the problem of GPU and MC. Wang et al. [32] solved the MC problem of a uniform linear array (ULA) based on subspace theory. In [33], a robust direction-of-arrival (DOA) estimation algorithm for quasi-stationary signals based on the Khatri-Rao (KR) subspace approach was put forward. It can solve the GPU problem of DOA estimation. Si et al. [34] tackled the GPU and MC problem for ULAs or uniform circular arrays (UCAs) by applying a group of auxiliary sensors. However, for the problem of GPU and MC in MIMO-EMVS, as far as we know, there are no corresponding references, so in this paper, we studied the GPU and MC problem of MIMO-EMVS.
Firstly, we propose a spatial-polarimetric domain ESPRIT-like algorithm based on centralized EMVS (C-SPD ESPRIT-like algorithm) for the estimation of 2D-DOA and PSA in MIMO-EMVSs under the condition of GPU. The EMVS adopts a centralized configuration. This algorithm can be applied to an arbitrary array configuration. Then, considering the mutual coupling of components of EMVS, we revise the C-SPD ESPRIT-like algorithm and apply it to a class of separated EMVSs. The GPU and MC problem are solved simultaneously. The proposed methods have low complexity for avoiding the angle searching operation and the array configuration can be arbitrary. And the effectiveness of proposed algorithms is verified by the simulation results.
The remainder of the paper is organized as follows: Section 2 is devoted to the introduction of the signal model of polarimetric MIMO radar. In Section 3, the two proposed methods for estimation of DOA under non-ideal conditions are described, and some discussions are presented. Section 4 gives a comparison of these methods. Simulation results are presented in Section 5 to evaluate the advantages of the proposed methods. At last, conclusions are drawn in Section 6.

Signal Model
Assuming there is a monostatic MIMO radar which hass M transmitters and N − 1 receivers. Each receiver is composed of a six-component centralized EMVS which is shown in Figure 1. As we all know, the spatial electromagnetic wave signal is a vector signal. The complete electric and magnetic information of a vector signal is the complex vector of six dimensions. This six dimensional vector is related to the DOA and polarization station angle of the target. The polarization station angle is composed of a polarization phase angle and the polarization phase difference. The EMVS consists of the phase centered coincidence of three orthogonal electric dipoles and three orthogonal magnetic rings that can get complete electromagnetic vector information, so each EMVS has six component outputs, representing the electric field and magnetic field components of the incident electromagnetic wave. In our model, the position of the m-th array element in the transmitting array is (x tm , y tm , z tm ), m = 1, 2, . . . , M and the position of the n-th array element in the receiving array is (x tn , y tn , z tn ), n = 1, 2, . . . , N − 1. There is no limitation of the array configuration of both the the transmitting array and the receiving array. That is to say they are arbitrary array configurations and later we will show that our algorithm has no requirement for a specific array configuration. (UCAs) by applying a group of auxiliary sensors. However, for the problem of GPU and MC in MIMO-EMVS, as far as we know, there are no corresponding references, so in this paper, we studied the GPU and MC problem of MIMO-EMVS. Firstly, we propose a spatial-polarimetric domain ESPRIT-like algorithm based on centralized EMVS (C-SPD ESPRIT-like algorithm) for the estimation of 2D-DOA and PSA in MIMO-EMVSs under the condition of GPU. The EMVS adopts a centralized configuration. This algorithm can be applied to an arbitrary array configuration. Then, considering the mutual coupling of components of EMVS, we revise the C-SPD ESPRIT-like algorithm and apply it to a class of separated EMVSs. The GPU and MC problem are solved simultaneously. The proposed methods have low complexity for avoiding the angle searching operation and the array configuration can be arbitrary. And the effectiveness of proposed algorithms is verified by the simulation results.
The remainder of the paper is organized as follows: Section 2 is devoted to the introduction of the signal model of polarimetric MIMO radar. In Section 3, the two proposed methods for estimation of DOA under non-ideal conditions are described, and some discussions are presented. Section 4 gives a comparison of these methods. Simulation results are presented in Section 5 to evaluate the advantages of the proposed methods. At last, conclusions are drawn in Section 6.

Signal Model
Assuming there is a monostatic MIMO radar which hass M transmitters and N − 1 receivers. Each receiver is composed of a six-component centralized EMVS which is shown in Figure 1. As we all know, the spatial electromagnetic wave signal is a vector signal. The complete electric and magnetic information of a vector signal is the complex vector of six dimensions. This six dimensional vector is related to the DOA and polarization station angle of the target. The polarization station angle is composed of a polarization phase angle and the polarization phase difference. The EMVS consists of the phase centered coincidence of three orthogonal electric dipoles and three orthogonal magnetic rings that can get complete electromagnetic vector information, so each EMVS has six component outputs, representing the electric field and magnetic field components of the incident electromagnetic wave. In our model, the position of the m-th array element in the transmitting array -. There is no limitation of the array configuration of both the the transmitting array and the receiving array. That is to say they are arbitrary array configurations and later we will show that our algorithm has no requirement for a specific array configuration.  Assuming the transmitting waveforms are normalized orthogonal signals, i.e., (1/Γ)∑ Γ τ=1 s(τ)s H (τ) = I M , where s(τ) = [s 1 (τ), s 2 (τ), . . . , s M (τ)] T ∈ C M×1 denotes M transmitted signals, τ = 1, 2, . . . , Γ is the sampling index in fast time. There are K far field uncorrelated point targets. The 2D-DOA of incident signals can be expressed as azimuth angle φ ∈ [0, 2π) and elevation angle θ ∈ [0, π]. They are measured from the positive x-axis and positive z-axis, respectively. The PSA of targets are auxiliary polarization angle Γ ∈ [0, π/2] and polarization phase difference η ∈ (−π, π], respectively. The received data can be expressed as follows: where t is the slow-time, i.e., snapshot. Λ t is a M × M complex diagonal matrix which represents the GPU of transmitting sensors. Λ r is a 6(N − 1) × 6(N − 1) complex diagonal matrix which represents the GPU of receiving sensors.
is the spatial-polarimetric domain (SPD) steering matrix of a single centralized EMVS. ⊕ is the Khatri-Rao product. a t (θ k , φ k ), a r (θ k , φ k ) and a pol (θ k , φ k , Γ k , η k ) are expressed as follows: where e (the first three elements of a pol (θ k , φ k , Γ k , η k )) and h (the last three elements of a pol (θ k , φ k , Γ k , η k )) represent the electric-field component and magnetic-field component, respectively. They are related to the 2D-DOA and PSA of targets. b(t) = [ρ 1 (t), . . . , ρ K (t)] T ∈ C K×1 represents reflection coefficient of all targets, where ρ k (t) = α k exp(j2π f k t). The amplitude of the reflection coefficient α k is related to the target radar cross section (RCS). The phase of reflection coefficient is related to the Doppler frequency of the target. Note that, here t represents the slow-time. w(t, τ) ∈ C 6(N−1)×1 represents additive white Gaussian noise whose mean value is zero and covariance matrix is σ 2 n I 6(N−1) . Through matched filtering, the received data can be represented as Sensors 2017, 17, 2457 . Perform vectorization to (5), we can obtain: And its columns are the virtual array steering vector a(θ, φ, . vec(·) represents the vectorization operation.
The noise corresponding to m-th transmitting antenna and the n-th receiving antenna is n n,m = w n s H m . The elements of the noise covariance matrix are equal to: We can see that n(t) is still a complex white Gaussian noise with zero mean and covariance matrix σ 2 n I 6M(N−1) . When there are no GPU and MC, we can use the method in [26] to estimate the 2D-DOA of targets. For virtual array after matched filtering, it extracts the component with the same orientation in EMVSs to construct a subarray. Then we can obtain six spatially identical subarrays. According to the SPD rotational invariance of the six subarrays, we can get C 2 6 = 15 rotation invariant factors (RIFs) by using the ESPRIT algorithm. According to the knowledge of [35], we can calculate the incident electromagnetic wave's electric-field and magnetic-field by only selecting five RIFs. Then we can perform vector cross-product between electric-field and magnetic-field to obtain the pointing vector of source. Last, 2D-DOA can be obtained by the triangle operation with the pointing vector. This is the method which is used in [26] and it is different with the spatial ESPRIT algorithm. It uses the SPD invariance property to construct the electromagnetic component and uses the vector cross-product of these components to get the DOA of targets, while the spatial ESPRIT directly uses the spatial invariance property to estimate the DOA of targets.
When GPU and MC occur, it results in significant distortion of the amplitude and phase of the signals received from the array. This spoils the invariance property of the SPD, so the direct use of the SPD ESPRIT algorithm will lead to wrong estimation of RIFs which will cause DOA estimation errors, therefore, the ESPRIT algorithm in [26] which is computationally efficient cannot be used directly. Based on this, we research the 2D-DOA estimation of MIMO-EMVSs and put forward the ESPRIT-like 2D-DOA estimation algorithm.

ESPRIT-Like 2D-DOA Estimation Algorithm
The main content of Section 3 includes the following two aspects: firstly, considering the problem of GPU, we propose a novel C-SPD ESPRIT-like algorithm with centralized EMVSs in Section 3.1. It utilizes the ISM to estimate the 2D-DOA and PSA of targets. The C-SPD ESPRIT-like algorithm can obtain good estimation performance without any information of the GPU. Then, taking into account the simultaneous problems of GPU and MC, we revise the C-SPD ESPRIT-algorithm and apply it to a class of separated EMVSs in Section 3.2. This can solve the problem of GPU and MC efficiently.

Centralized Electromagnetic Vector Receiver
We propose the C-SPD ESPRIT-like algorithm for when the GPU occurs. It needs a well-calibrated centralized EMVS in the receiving array, so we add a well-calibrated centralized EMVS to the receiving array. To facilitate the derivation, we set it as the first receiver element. If it is not the first element, we can conduct a simple replacement operation on the received data matrix, which makes it become the first array. Then, for virtual array after matched filtering (referencing Equation (5)), we extract the component with the same orient in EMVSs to construct a subarray. We can obtain six spatially identical subarrays. Here we take some EMVSs located in the y axis for example, as shown in Figure 2. Note that the position of EMVS in the receiving array can be arbitrary and it does not affect the later estimation algorithm of DOA. efficiently.

Centralized Electromagnetic Vector Receiver
We propose the C-SPD ESPRIT-like algorithm for when the GPU occurs. It needs a wellcalibrated centralized EMVS in the receiving array, so we add a well-calibrated centralized EMVS to the receiving array. To facilitate the derivation, we set it as the first receiver element. If it is not the first element, we can conduct a simple replacement operation on the received data matrix, which makes it become the first array. Then, for virtual array after matched filtering (referencing Equation (5)), we extract the component with the same orient in EMVSs to construct a subarray. We can obtain six spatially identical subarrays. Here we take some EMVSs located in the y axis for example, as shown in Figure 2. Note that the position of EMVS in the receiving array can be arbitrary and it does not affect the later estimation algorithm of DOA.

New Rotational Invariance Property of the SPD with Gain and Phase Error
Here we will derive the new rotational invariance property of the SPD under the condition of GPU.
Define the following vector and matrix: where i and j represent integers between 1 and 6.

New Rotational Invariance Property of the SPD with Gain and Phase Error
Here we will derive the new rotational invariance property of the SPD under the condition of GPU.
Define the following vector and matrix: where i and j represent integers between 1 and 6. e T i and e T j are row extraction vector, J i and J j are row extraction matrices which are used to extract the components with the same orientation in EMVSs. These extraction matrices have the following properties: That is to say J i J T i is an MN × MN identity matrix and J T i J i is a diagonal matrix, then utilizing these properties and considering the GPU, we can get the following equation: The both sides of the equation are multiplied by J i ΛJ T i −1 , we get: Similarly, we can get: When there is no GPU, we know that there is a rotational invariance of SPD (cf. [26]): where . When there are GPU, substituting Equations (11) and (12) into (13), we get: The both sides of the equation are multiplied by J j ΛJ T j , we get the new invariance property of SPD under the condition of gain and phase error: The equation looks rather complicated, and we'll simplify it.
so the left side of Equation (15) can be simplified as follows: is a vector which contains the gain and phase error of the i-th subarray. Substituting it into Equation (15), we get: This is the new invariance property of SPD under the condition of gain and phase error.

Closed form Solution of RIFs
Here, we will derive the closed form solution of RIFs based on Equation (16). The covariance matrix of received data can be estimated by: By eigen-decomposition, we can obtain: where U s = ΛAT is the signal subspace Referring Equations (11) and (12), define U ri and U rj as the i-th and j-th components of the signal subspace which can be represented as follows: Substituting Equation (19) into Equation (16), we can get the new invariance property of signal space under the condition of gain and phase error: where Because diag c ri,j and Ψ i,j are unknown, the solution of Equation (22) can be got by solving the following constrained optimization problem: where According to the least squares method, the solution of Equation (23) is: By substituting Equation (24) into (23), the optimization problem can be translated into: where According to the related knowledge of matrix theory, we can simplify the objective function as follows: where denotes the Hadamard product. Now we get the new optimazition problem:ĉ ri,j = argmin According to the Lagrange multipliers method, the solution of (27) is: Substituting Equation (28) into (24), we can get the estimation as follow: Then, performing eigen-decompostion to it, estimation of RIFs can be obtained. Note that Q ri,j is required to be nonsingular to estimate the vectorĉ ri,j . In the case of infinite snapshots, Q ri,j is a nonsingular matrix. To ensure that Q ri,j is also a nonsingular matrix with finite snapshots in practice, diagonal loading is a possible method to handle this problem. In addition, from the extensive experiments with finite snapshots that we have made, the matrix Q ri,j is always nonsingular. Thus, it is not necessary to use the diagonal loading method for Q ri,j in general.

Estimation of 2D-DOA and PSA
Because RIFs χ i,j k |i, j = 1, . . . , 6 in different Φ i,j have different orders. So we should pair these RIFs. Note that, RIFs are matched with their eigenvectors. Thus, we can pair these RIFs for the identical target by pairing the orthogonal rows of T i,j . And the procedure is omitted here and interested readers can refer to the [26].
Because i, j = 1, . . . , 6, so here are C 2 6 = 15 choices for RIFs χ i,j k . Set i = j + 1. That is to say, we pick five from them.
And the relationship between these polarization components can be represented as follows: Then, the Pointing vector can be obtained by the cross-multiplication between the electric-field component and the magnetic-field component based on Maxwell equation: We know that there is a relationship between Pointing vector and the 2D-DOA of target: Combing Equations (30)-(32), we have Then we can get the estimation of direction cosinesûvŵ by normalized processing to the result of Equation (33). Last, we can get the 2D-DOA estimation through the following triangulation: None of the above processing uses the antenna location information. So it is suitable for arbitrary array configuration.
Then, according to Equation (4), we get Substitute (θ kφk ) into the above equation, the corresponding PSA can be got by: According to the above analysis, the estimation of 2D-DOA and PSA for monostatic MIMO radar with centralized EMVSs under GPU can be summarized as follows: Step 1. Perform matched filtering and vectorization to the received data by (5) and (6); Step 2. Calculate the covariance matrix of virtual array by (17). And perform the eigen-decomposition to it to get the signal subspace by (18); Step 3. Compute the estimation of the relative GPU of the transmit and receive sensors by (28).
From the above analysis, we can see that the algorithm has the following advantages:
Suitable for any configuration; 3.
Similarly to the ESPRIT method, the calculation is small without angle searching; 4.
The angle of the whole airspace can be estimated; 5.
It is applicable to multiple EMVSs at the receiver; 6.
MN targets can be estimated at most.

Separated Electromagnetic Vector Receiver
In the above analysis, we did not consider the MC between components of the centralized EMVS. When the MC and GPU coexist between the components of the centralized EMVS, the centralized EMVSs cannot get good estimation results due to the serious problem of mutual coupling. One way to solve this problem is to adopt separated EMVSs which are shown in Figure 3. The separated EMVSs can reduce the influence of MC, but the algorithm we proposed in Section 3.1 may not be suitable, and we need to do some revision. Besides, in order to make our algorithm feasible, the structure of separated EMVS may need to meet certain conditions. Now we will revise the algorithm and derive a class of separated EMVSs which are satisfied with the requirements. The spatial phase shift factors of separated electromagnetic vector sensor with arbitrary structure are listed in Table 1.

6.
MN targets can be estimated at most.

Separated Electromagnetic Vector Receiver
In the above analysis, we did not consider the MC between components of the centralized EMVS. When the MC and GPU coexist between the components of the centralized EMVS, the centralized EMVSs cannot get good estimation results due to the serious problem of mutual coupling. One way to solve this problem is to adopt separated EMVSs which are shown in Figure 3. The separated EMVSs can reduce the influence of MC, but the algorithm we proposed in Section 3.1 may not be suitable, and we need to do some revision. Besides, in order to make our algorithm feasible, the structure of separated EMVS may need to meet certain conditions. Now we will revise the algorithm and derive a class of separated EMVSs which are satisfied with the requirements. The spatial phase shift factors of separated electromagnetic vector sensor with arbitrary structure are listed in Table 1.   The most difference between the separated EMVS and the centralized EMVS is that the polarization steer matrix changed. The polarization steer matrix of separated EMVS is: As we can see, each component of EMVS has added a phase shift factor. Then, under the gain and phase error condition, the rotation invariance of SPD is transformed into the following form: diag c ri,j J i ΛA = J j ΛAΦ i,j Compared with Equation (16), the RIFs have changed. The original RIFs is Φ i,j = diag a pol,i (θ 1 , φ 1 , Γ 1 , η 1 )/a pol,j (θ 1 , φ 1 , Γ 1 , η 1 ), . . . , a pol,i (θ K , φ K , Γ K , η K )/a pol,j (θ K , φ K , Γ K , η K ) . The new , but this doesn't affect the solution of new RIFs. That is to say, the algorithm we proposed in Section 3.1 still can be used to estimate the new RIFs, so if there is a well-calibrated separated EMVS in the receiving array, the new RIFs still can be estimated by the eigen-decompostion of Equation (29).
The 2D-DOA estimation relies on the vector cross product of electric-field components and magnetic-field components which are reconstructed based on RIFs. Because the RIFs have changed, so the vector cross product of separated EMVSs are changed to the new form which is shown in Equation (38).
The vector cross product result shows that each component contains two "phase shift factors". This makes it very difficult to estimate the DOA of targets. We discovered that if the two phase shift factors are equal, i.e., Equations (39)-(41) are shown, the polarization parameter in the results of vector cross product can be eliminated. This is very favorable to our estimation of targets' DOA. The reason of eliminating the polarization parameters is to reduce the unknown quantity contained in the equation, and to facilitate the estimation of azimuth and elevation angle. The condition is not a necessary condition, that is, array design does not meet the needs of the elimination of polarization parameters.
sin θ sin φ sin 2 Γ + sin θ cos θ cos φ sin Γ cos Γe jη ·e j 2π cos θ sin 2 φ sin 2 Γ + cos 2 φ cos 2 Γ + sin φ cos φ sin Γ cos Γ e −jη + cos 2 θe jη ·e j 2π Λ [(x hx −x ey )u+(y hx −y ey )v+(z hx −z ey )w] + cos θ cos 2 φ sin 2 Γ + sin 2 φ cos 2 Γ − sin φ cos φ sin Γ cos Γ e −jη + cos 2 θe jη According to Equations (39)-(41), we can derive the following structural relationship of components of EMVS respectively: It shows that the absolute value of the direction cosine estimation in all directions can be obtained by the modulus of the Equation (46). Positive and negative determination of directional cosine estimation may require some prior information. Unless additional conditions are added, we can estimate hemispheric airspace at most. If we get the true value of these direction cosine based on prior information, the estimation result is as follows: According to Equation (37), we can get the following equation: Note that, compared with Equation (35), there is a phase shift factor in the Equation (48). Substitute (θ k ,φ k ) into the above equation, we can get the estimation of PSA: Note that, the structure of the EMVS needs to satisfy Equation (45), but the array configuration still can be arbitrary.
To differentiate from the C-SPD ESPRIT-like algorithm of centralized EMVSs which we proposed in Section 3.1, we call this method as spatial-polarimetric domain ESPRIT-like algorithm based on separated EMVS (S-SPD ESPRIT-like algorithm). Where 'C' and 'S' represent 'centralized' and 'separated', respectively.

Comparison of Advantages and Disadvantages of Each Method
Here we compare our algorithm with several other error correction algorithms. The method in [32,33] can only calibrate one error, so when the two errors occur simultaneously, it will seriously affect the performance of the two methods. Besides, the method in [32] is a search-based algorithm which has large computational complexity. The method in [34] can tackle GPU and MC at the same time, but it only suitable for ULA or UCA. Our proposed method can solve the GPU and MC problem of MIMO-EMVS simultaneously and the array configuration can be arbitrary. That is to say, when the array is not ULA or UCA, the method in [34] will be invalid and our method is still able to work. Therefore, our method has wider applicability. Our method is based on the ESPRIT algorithm, so our method also has low complexity. Because we use the rotational invariance of spatial-polarimetric domain and don't use the array aperture, so there will a certain distance between the RMSE curve of our method and the Cramér-Rao Bound (CRB). The comparison of algorithm of Ref. [26], C-SPD ESPRIT-like algorithm and S-SPD ESPRIT-like algorithm is listed in Table 2. Table 2. Comparison of three algorithms.

Algorithm of Ref. [26] C-SPD ESPRIT-Like S-SPD ESPRIT-Like
Note that none of the above methods requires any angle searching process. These algorithms are based on the ESPRIT algorithm, so they all have low complexity. Note that, both the C-SPD ESPRIT-like algorithm and S-SPD ESPRIT-like algorithm are suitable for arbitrary array configuration. That is because we use the connection between these electromagnetic components to estimate DOA which has no requirement for array configuration.

Numerical Results
In this section, we will perform several simulation experiments to test the effectiveness of our algorithms. Assume there is a MIMO radar with M = 4 and N = 4. The transmitting and receiving sensors are set on the x-axis and y-axis, respectively. The spacing between adjacent element is half the wavelength. Therefore the MIMO radar consists of an L-shape array. Note that the MIMO radar can take an arbitrary configuration.
In the first simulation, we show the estimation performance of the proposed C-SPD ESPRIT-like algorithm. Assume there are two targets which incident from the angle (θ 1 , φ 1 ) = (30 • , 40 • ) and (θ 2 , φ 2 ) = (60 • , 70 • ). Their PSA values are (Γ 1 , η 1 ) = (45 • , 90 • ) and (Γ 2 , η 2 ) = (45 • , −90 • ). That is to say the first target is left-circularly polarized and the second target is right-circularly polarized. In this simulation, assume that SNR = 20 dB and the number of snapshots is 1000. Figures 4 and 5 show the histograms of estimation results by our algorithm and algorithm of [26], respectively. Five hundred Monte Carlo trials are performed with each algorithm. We can see that the proposed algorithm can accurately estimate the parameters of the target which verifies the correctness of the proposed 2D-DOA estimation algorithm. Meanwhile, the performance of method in [26] is poor.    In the second simulation, we compare the estimation accuracy of the proposed C-SPD ESPRIT-like algorithm. The parameters are same as in the first simulation. The SNR varies from 0 dB to 40 dB. Two hundred simulations are conducted under each SNR. The simulation result is shown in Figure 6. As we can see, the C-SPD ESPRIT-like algorithm is getting better and better with the increase of SNR. There is a gap between the proposed C-SPD ESPRIT-like algorithm and CRB (for a detailed derivation, see Appendix A), while the performance of the method in [26] is poor no matter how much the SNR increases. The reason for the existence of the gap is that the C-SPD ESPRIT-like algorithm only utilizes the information inside the vector sensor and the array aperture is not utilized. In the third simulation, we compare the RMSE versus the number of snapshots. The number of snapshots is set to vary from 100 to 2100. Other simulation parameters are the same as those of the second simulation. The result is shown in Figure 7. We can see that the C-SPD ESPRIT-like algorithm is getting better and better with the increase of snapshots. There is a gap between the proposed C-SPD ESPRIT-like algorithm and CRB. The reason is same as in the analysis of the second simulation. The performance of the algorithm in [26] is poor no matter how much the snapshots increases. In the third simulation, we compare the RMSE versus the number of snapshots. The number of snapshots is set to vary from 100 to 2100. Other simulation parameters are the same as those of the second simulation. The result is shown in Figure 7. We can see that the C-SPD ESPRIT-like algorithm is getting better and better with the increase of snapshots. There is a gap between the proposed C-SPD ESPRIT-like algorithm and CRB. The reason is same as in the analysis of the second simulation. The performance of the algorithm in [26] is poor no matter how much the snapshots increases. In the third simulation, we compare the RMSE versus the number of snapshots. The number of snapshots is set to vary from 100 to 2100. Other simulation parameters are the same as those of the second simulation. The result is shown in Figure 7. We can see that the C-SPD ESPRIT-like algorithm is getting better and better with the increase of snapshots. There is a gap between the proposed C-SPD ESPRIT-like algorithm and CRB. The reason is same as in the analysis of the second simulation. The performance of the algorithm in [26] is poor no matter how much the snapshots increases.  In the fourth simulation, we test the estimation accuracy of the S-SPD ESPRIT-like algorithm with separated EMVSs under the condition of GPU and MC. The contrast experiment is the C-SPD ESPRIT-like algorithm with centralized EMVSs under the condition of GPU and MC. The elements of separated EMVSs are set to far enough apart to avoid the MC and the structure is based on the rule we proposed in Equation (45). The mutual coupling matrix of collocated EMVSs is set as a Toeplitz matrix. Other simulation parameters are the same as those of the second simulation. The SNR varies from 0 dB to 40 dB. Two hundred simulations are conducted under each SNR. The simulation results are shown in Figure 8. We can see that the performance of C-SPD ESPRIT-like algorithm is poor no matter how much the signal to noise ratio increases, so the C-SPD ESPRIT-like algorithm with collocated EMVSs can't deal with the mutual coupling, while we can see that the accuracy of the S-SPD ESPRIT-like algorithm becomes better with the increase of SNR which proves the effectiveness of the S-SPD ESPRIT-like algorithm with separated EMVSs. In the fourth simulation, we test the estimation accuracy of the S-SPD ESPRIT-like algorithm with separated EMVSs under the condition of GPU and MC. The contrast experiment is the C-SPD ESPRIT-like algorithm with centralized EMVSs under the condition of GPU and MC. The elements of separated EMVSs are set to far enough apart to avoid the MC and the structure is based on the rule we proposed in Equation (45). The mutual coupling matrix of collocated EMVSs is set as a Toeplitz matrix. Other simulation parameters are the same as those of the second simulation. The SNR varies from 0 dB to 40 dB. Two hundred simulations are conducted under each SNR. The simulation results are shown in Figure 8. We can see that the performance of C-SPD ESPRIT-like algorithm is poor no matter how much the signal to noise ratio increases, so the C-SPD ESPRIT-like algorithm with collocated EMVSs can't deal with the mutual coupling, while we can see that the accuracy of the S-SPD ESPRIT-like algorithm becomes better with the increase of SNR which proves the effectiveness of the S-SPD ESPRIT-like algorithm with separated EMVSs. In the fourth simulation, we test the estimation accuracy of the S-SPD ESPRIT-like algorithm with separated EMVSs under the condition of GPU and MC. The contrast experiment is the C-SPD ESPRIT-like algorithm with centralized EMVSs under the condition of GPU and MC. The elements of separated EMVSs are set to far enough apart to avoid the MC and the structure is based on the rule we proposed in Equation (45). The mutual coupling matrix of collocated EMVSs is set as a Toeplitz matrix. Other simulation parameters are the same as those of the second simulation. The SNR varies from 0 dB to 40 dB. Two hundred simulations are conducted under each SNR. The simulation results are shown in Figure 8. We can see that the performance of C-SPD ESPRIT-like algorithm is poor no matter how much the signal to noise ratio increases, so the C-SPD ESPRIT-like algorithm with collocated EMVSs can't deal with the mutual coupling, while we can see that the accuracy of the S-SPD ESPRIT-like algorithm becomes better with the increase of SNR which proves the effectiveness of the S-SPD ESPRIT-like algorithm with separated EMVSs.

Conclusions
In this work, we research the 2D-DOA and PSA estimation for monostatic MIMO Radar with EMVSs under the condition of GPU and MC. Aiming at resolving the GPU problem, we put forward a C-SPD ESPRIT-like algorithm. The ESPRIT-like algorithm can get good estimation results without knowing the GPU. Furthermore, it is suitable for arbitrary array configurations and has low complexity for avoiding the angle searching procedure. Aiming at the situation where MC and GPU between the elements exist together, we give a class of separated EMVSs and put forward the S-SPD ESPRIT-like algorithm. It can solve the GPU and MC problem simultaneously. Simulation results validate the effectiveness of our algorithms.

Conclusions
In this work, we research the 2D-DOA and PSA estimation for monostatic MIMO Radar with EMVSs under the condition of GPU and MC. Aiming at resolving the GPU problem, we put forward a C-SPD ESPRIT-like algorithm. The ESPRIT-like algorithm can get good estimation results without knowing the GPU. Furthermore, it is suitable for arbitrary array configurations and has low complexity for avoiding the angle searching procedure. Aiming at the situation where MC and GPU between the elements exist together, we give a class of separated EMVSs and put forward the S-SPD ESPRIT-like algorithm. It can solve the GPU and MC problem simultaneously. Simulation results validate the effectiveness of our algorithms.