Computationally Efficient Unitary ESPRIT Algorithm in Bistatic MIMO Radar

A low complexity unitary estimating signal parameter via rotational invariance techniques (ESPRIT) algorithm is presented for angle estimation in bistatic multiple-input-multiple-output (MIMO) radar. 'e devised algorithm only requires calculating two submatrices covariance matrix, which reduces the computation cost in comparison with subspace methods. Moreover, the signal subspace can be efficiently acquired by exploiting the NystrÖm method, which only needs O(MNK2) flops. 'us, the presented algorithm has an essentially diminished computational effort, especially useful when K≪MN, while it can achieve efficient angle estimation accuracy as well as the existing algorithms. Several theoretical analysis and simulation results are provided to demonstrate the usefulness of the proposed scheme.


Introduction
Target estimation has been a significant problem in radar systems, which has been applied in widespread in sonar, guidance systems, speech processing, communication, medical signal processing, and other fields [1][2][3]. In recent years, considerable research interests have been drawn to MIMO radar [4][5][6][7][8][9][10][11][12][13], which exploits multiple antennas to emit diverse waveforms and utilizes multiple antennas to receive the echo signals [14]. is leads to its more underlying benefits over phased-array radar [15][16][17] (e.g., enhancing the spatial resolution, fading effect overcoming, and enhancing the parameter identifiability). MIMO radar can be regarded as an expansion of the phased-array radar, where the exploited waveforms are effectively independent [18]. Generally, MIMO radars can be divided into two types, the collocated MIMO radar and the statistical MIMO radar, based on the different array antenna configurations [19]. Furthermore, the collocated MIMO radars are categorised into two types, namely, the monostatic MIMO radar and the multistatic MIMO radar. Due to the fact that the emitting and receiving antennas are not in the identical location, the DOD and DOA estimation has become a considerable research matter [4,[18][19][20][21]. In our work, we mainly focus on the DOD and DOA estimation issue in the bistatic MIMO radar.
According to the recent researches, several algorithms [4][5][6][7][8][9][10] have been proposed for estimation angle in the bistatic MIMO radar. In [4], the reduced-dimension multiple signal classification (MUSIC) algorithm that uses onedimensional search is presented to angle estimation, which achieves high angle estimation accuracy in comparison with Capon algorithm [20]. In [5], the Capon algorithm is extended to DOD and DOA estimation, which has heavy computational complexity for requiring two-dimensional angle search. Moreover, the technique is subjected to some performance degradations for the proximate receiving steering vector. Besides, the estimation of angles needs peak searching with computational intensive. e root-MUSIC algorithm [6] without peak searching is presented by utilizing polynomial rooting technique to reduce the computational cost. In [7], the ESPRIT technique that uses the invariance technique of both the transmitting array and the receiving array is presented to estimate angle in the bistatic MIMO radar. However, the algorithm requires the pairing operation. In [8], to address the problem of automatic pairing, a combination ESPRIT-MUSIC algorithm is developed, which provides beneficial angle accuracy. In [9], a unitary ESRPIT technique that exploits the real-valued processing is devised for estimating angle in the bistatic MIMO radar, which has high estimation precision. In [10], the maximum likelihood algorithm is presented for direction finding estimation in MIMO radar. In [22], the novel joint angle estimation method is proposed by using tensor decomposition in the nested bistatic MIMO radar. Moreover, various methods are introduced for bistatic MIMO radar in [23][24][25]. However, the abovementioned algorithms have a large amount of computation since they require the calculation of sample covariance matrix (SCM) and its eigenvalue decomposition (EVD) to obtain the noise subspace or signal noise, especially for large MIMO radar array and a great deal of snapshots scenarios. In order to tackle this serious problem, a computationally efficient algorithm is devised for direction estimation in this work. Unlike the existing algorithms [4][5][6][7][8][9][10], the presented algorithm only requires to compute two submatrices of the SCM, which avoids calculating of SCM and its EVD by exploiting the NystrÖm technique. e proposed method can be also applied in the nonuniform linear array, L-shape array, and uniform circular array for angle estimation. e NystrÖm method has been extensively applied in speed up methods [26,27] and is first utilized by Williams and Seeger [27] for sparsifying kernel matrices. By exploiting the NystrÖm method [28,29], we extend the previous work [30] and develop a low complexity unitary ESPRIT algorithm which not only has high angle estimation precision but also obtains light computational cost, especially in large MIMO radar array scenario. In this paper, we derive a new powerful unitary ESPRIT approach, which exhibits many benefits as follows: (a) it has much lower computational cost than that of the ESRPIT and unitary ESPRIT methods; (b) it enjoys higher angle estimation precision than the ESPRIT algorithm; (c) it is suitable for direction finding estimation of large MIMO radar array. e benefits of the presented algorithm are shown by some simulation experiments.

Data Model
In this paper, we think about a bistatic MIMO radar system ( Figure 1) constituted of M-transmitting antenna array and N-receiving antenna array, both of which are half-wavelength spaced uniform linear arrays [7][8][9]. Assume that there exist P noncoherent targets located in the same range bin. e DOD and DOA of the pth target relative to the transmitting array normal and the receiving array normal are denoted by θ p and ϕ p (p � 1, 2, . . . , P), respectively.
us, the signal model can be given as [7,8] where A � [a 1 , a 2 , . . . , a P ] denotes an MN × P matrix consisting of the P steering vectors and a p � a r (ϕ p ) ⊗ a t (θ p ) illustrates the Kronecker product of the receiving array steering vector and the transmitting array steering vector for the pth source. a r (ϕ p ) and a t (θ p ) are respectively rewritten as and u p � sin θ p , v p � sin ϕ p , where ϕ p and θ p represent the DOA and DOD, respectively.
T is a column vector, in which s p (t) � α p e j2πf dp t denotes the envelope of the reflected signal with α p being the amplitude containing the reflection coefficients and path losses and so on [7][8][9]. n(t) denotes an MN × 1 complex Gaussian white noise vector with zero mean and covariance matrix σ 2 I MN .

Real-Valued Processing.
In order to reduce computational complexity, we have to transform the complex data to real data by matrix method since the array, the received data, is complex data. Let Y be represented as the data matrix consisting of L snapshots y(t l ), 1 ≤ l ≤ L. e augmented data matrix is defined as Z � [YΠ MN Y * Π L ], where Π MN represents the exchange matrix including J ones on its antidiagonal and zeros elsewhere. en, the real-valued matrix is expressed as [9,11] where Q J signifies sparse unitary matrix, expressed as

Signal Subspace Estimation.
To use the NystrÖm technique [27,28] for estimating angle, we disintegrate the matrix Γ as follows [30]: where Γ 1 ∈ R K×L and Γ 2 ∈ R (MN− K)×L are the real-valued submatrices received by the first K antenna and the rest of the (MN − K) antennas, respectively. We define Moreover, we must ensure that R 11 denotes full rank It is noted that K has not been required to ascend substantially with MN. For instance, when MN grows from 10 to 30, a relatively little K, such as K � 12, is sufficient to insure estimating precision, which also reduces the computational complexity.
Suppose that the EVD of R 11 is U 11 Λ 11 U H 11 , where U 11 ∈ C K×K denotes the eigenvector matrix and Λ 11 represents the diagonal matrix. Defining U 21 ≜ R 21 U 11 Λ −1 11 , we can constitute a new matrix as follows [30]: en, according to the results from the remark, we can obtain the signal subspace without the computation of SCM and its EVD.

Computational Complexity and Cramér-Rao Bound (CRB)
e presented technique does not need utilizing the whole SCM. Instead, it requires calculating R 11 (MN, L). Furthermore, referring to [11], we use CRB in simulation as follows: where Mathematical Problems in Engineering

Simulation Results
In this installment, a vast number of computer simulations are demonstrated to prove the effectiveness of the proposed technique. We compare performance of the estimating angle of the presented method with the ESPRIT algorithms [7] and unitary ESPRIT [9] and present their computational complexity analysis. In the following simulation experiments, 200 Monte-Carlo iterations are adopted for the bistatic MIMO radar in the experiments. We suppose that there exist three noncoherent targets and their location is at angles e root mean squared error (RMSE) of over angle [9] is exploited in the simulation experiments. Figures 2 and 3 describe the angle estimation paired results of the presented scheme with SNR � 10 dB and SNR � 10 dB, respectively. It can be shown that the transmit angles (DODs) and receive angles (DOAs) can be clearly seen. Figure 3 also implies that the presented scheme can efficiently estimate angle of the targets in low SNR scenario.
Figures 4 and 5 demonstrate performance comparison of the estimating angle with M � 8, N � 6 and M � 6, N � 6, respectively. We compare the presented technique with the ESPRIT and the unitary ESPRIT methods. Figures 4 and 5 demonstrate that the proposed algorithm has much better estimation precision than the ESPRIT method and enjoys high estimation precision that is almost the same as the unitary ESPRIT scheme at high SNR range. However, the presented algorithm is somewhat inferior to the unitary ESPRIT scheme at the low SNR scenario. Figures 6-9 show performance comparison of estimation of the presented technique with L � 50 and L � 100 for different M/N, respectively. From Figures 6-9, we can find that the angle estimation precision of the presented scheme is significantly enhanced with the number of transmitting array elements/receiving array elements increasing. Multiple receiving/transmitting array elements enhance estimation precision owing to diversity gain.            Mathematical Problems in Engineering beneficial estimation precision at small number of snapshots scenario. Figures 12-14 illustrate the complexity comparison with K � 5, 10, 15, where we can find the proposed algorithm has much less computational cost in comparison with the ES-PRIT and the unitary ESPRIT schemes, particularly when M � N becomes larger. Figure 15 and Table 1 describe the runtime of the three ESPRITschemes. ey depict the average CPU time required to calculate each ESPRIT approach on the personal computer with Intel(R) core(TM) 2 Duo CPU T3700 processor. We can clearly observe that the presented approach is much more computationally effective than the existing schemes, especially when M � N becomes bigger.

Conclusion
In this paper, we have developed a low complexity unitary ESPRIT method for estimating angle in the bistatic MIMO radar. Compared with the existing unitary ESPRIT and ESPRIT algorithms which require O((M 2 N 2 L + M 3 N 3 )/4) and O(M 2 N 2 L + M 3 N 3 ) flops, respectively, our approach only needs O(2MNLK + MNK 2 ) flops, thereby being much more computationally effective, especially for the case of a large MIMO radar array. Moreover, extensive simulation results demonstrate that the estimation precision of the presented scheme is much higher by comparison with the ESPRIT method and very similar to the unitary ESPRIT algorithm. In the future research, the presented technique can be extended to a different application such as estimating angle in the monostatic MIMO radar.

Data Availability
e relevant data used to support the findings of this study are within the manuscript.

Conflicts of Interest
e authors declare that there are no conflicts of interest in this work.